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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:24,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:24,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:24,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:24,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:24,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:24,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:25,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:25,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:25,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:25,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:25,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:25,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:25,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:25,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:25,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:25,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:25,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:25,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:25,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:25,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:25,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:25,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:25,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:25,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:25,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:25,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:25,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:25,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:25,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:25,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:25,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:25,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:25,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:25,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:25,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:25,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:25,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:25,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:25,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:25,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:25,064 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,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:25,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:25,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:25,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:25,085 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:25,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:25,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:25,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:25,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:25,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:25,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:25,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:25,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:25,088 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:25,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:25,088 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:25,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:25,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:25,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:25,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:25,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:25,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:25,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:25,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:25,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:25,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:25,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:25,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:25,091 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:25,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:25,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:25,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:25,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:25,391 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:25,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-1.i [2019-10-15 01:06:25,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2c0b8fd/edea96003cb04fdd85f1ef11bd0f2b36/FLAGae10bff6a [2019-10-15 01:06:25,950 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:25,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2019-10-15 01:06:25,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2c0b8fd/edea96003cb04fdd85f1ef11bd0f2b36/FLAGae10bff6a [2019-10-15 01:06:26,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2c0b8fd/edea96003cb04fdd85f1ef11bd0f2b36 [2019-10-15 01:06:26,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:26,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:26,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:26,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:26,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:26,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:26" (1/1) ... [2019-10-15 01:06:26,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ca977a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:26, skipping insertion in model container [2019-10-15 01:06:26,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:26" (1/1) ... [2019-10-15 01:06:26,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:26,357 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:26,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:26,546 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:26,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:26,704 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:26,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:26 WrapperNode [2019-10-15 01:06:26,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:26,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:26,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:26,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:26,720 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:26" (1/1) ... [2019-10-15 01:06:26,721 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:26" (1/1) ... [2019-10-15 01:06:26,729 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:26" (1/1) ... [2019-10-15 01:06:26,730 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:26" (1/1) ... [2019-10-15 01:06:26,740 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:26" (1/1) ... [2019-10-15 01:06:26,746 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:26" (1/1) ... [2019-10-15 01:06:26,752 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:26" (1/1) ... [2019-10-15 01:06:26,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:26,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:26,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:26,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:26,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:26" (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:26,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:26,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:26,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:06:26,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:06:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:06:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:06:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:06:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:06:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:06:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:06:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:06:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:27,201 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:27,202 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 01:06:27,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:27 BoogieIcfgContainer [2019-10-15 01:06:27,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:27,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:27,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:27,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:27,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:26" (1/3) ... [2019-10-15 01:06:27,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faf315a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:27, skipping insertion in model container [2019-10-15 01:06:27,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:26" (2/3) ... [2019-10-15 01:06:27,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faf315a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:27, skipping insertion in model container [2019-10-15 01:06:27,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:27" (3/3) ... [2019-10-15 01:06:27,212 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2019-10-15 01:06:27,222 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:27,230 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:27,241 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:27,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:27,268 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:27,268 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:27,268 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:27,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:27,268 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:27,268 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:27,269 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-15 01:06:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:06:27,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:27,295 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:27,297 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2138170830, now seen corresponding path program 1 times [2019-10-15 01:06:27,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:27,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402268028] [2019-10-15 01:06:27,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:27,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:27,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:27,449 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:27,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402268028] [2019-10-15 01:06:27,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:27,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:06:27,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692144124] [2019-10-15 01:06:27,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:06:27,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:27,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:06:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:06:27,476 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-10-15 01:06:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:27,500 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2019-10-15 01:06:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:06:27,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-15 01:06:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:27,511 INFO L225 Difference]: With dead ends: 66 [2019-10-15 01:06:27,511 INFO L226 Difference]: Without dead ends: 30 [2019-10-15 01:06:27,515 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:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-15 01:06:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-15 01:06:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-15 01:06:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-10-15 01:06:27,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2019-10-15 01:06:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:27,560 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-15 01:06:27,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:06:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-10-15 01:06:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:06:27,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:27,562 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] [2019-10-15 01:06:27,562 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:27,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:27,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1430244045, now seen corresponding path program 1 times [2019-10-15 01:06:27,563 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:27,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103637238] [2019-10-15 01:06:27,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:27,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:27,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:27,670 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:27,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103637238] [2019-10-15 01:06:27,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:27,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:27,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142110723] [2019-10-15 01:06:27,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:27,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:27,674 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2019-10-15 01:06:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:27,778 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-10-15 01:06:27,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:27,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:06:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:27,782 INFO L225 Difference]: With dead ends: 67 [2019-10-15 01:06:27,782 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 01:06:27,783 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:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 01:06:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-10-15 01:06:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 01:06:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-15 01:06:27,792 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2019-10-15 01:06:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:27,793 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-15 01:06:27,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-10-15 01:06:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:06:27,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:27,794 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] [2019-10-15 01:06:27,794 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1498528533, now seen corresponding path program 1 times [2019-10-15 01:06:27,795 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:27,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784082570] [2019-10-15 01:06:27,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:27,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:27,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:27,915 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:27,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784082570] [2019-10-15 01:06:27,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487358411] [2019-10-15 01:06:27,918 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:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:27,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:06:27,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:28,052 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,052 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:28,138 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,141 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:06:28,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 12 [2019-10-15 01:06:28,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683198891] [2019-10-15 01:06:28,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:06:28,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:06:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:06:28,146 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 10 states. [2019-10-15 01:06:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:28,248 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-10-15 01:06:28,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:06:28,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-10-15 01:06:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:28,251 INFO L225 Difference]: With dead ends: 55 [2019-10-15 01:06:28,251 INFO L226 Difference]: Without dead ends: 50 [2019-10-15 01:06:28,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 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:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-15 01:06:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-10-15 01:06:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 01:06:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-15 01:06:28,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 22 [2019-10-15 01:06:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:28,260 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-15 01:06:28,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:06:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-15 01:06:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:06:28,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:28,262 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, 1] [2019-10-15 01:06:28,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:28,466 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -682773586, now seen corresponding path program 1 times [2019-10-15 01:06:28,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:28,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151161535] [2019-10-15 01:06:28,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:28,595 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:28,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151161535] [2019-10-15 01:06:28,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374905604] [2019-10-15 01:06:28,596 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:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:28,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:06:28,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:28,684 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:28,685 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:28,716 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:28,716 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:06:28,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2019-10-15 01:06:28,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451642270] [2019-10-15 01:06:28,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:06:28,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:28,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:06:28,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:28,718 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 6 states. [2019-10-15 01:06:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:28,789 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2019-10-15 01:06:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:06:28,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-15 01:06:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:28,794 INFO L225 Difference]: With dead ends: 100 [2019-10-15 01:06:28,794 INFO L226 Difference]: Without dead ends: 71 [2019-10-15 01:06:28,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-15 01:06:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2019-10-15 01:06:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-15 01:06:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-10-15 01:06:28,803 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 28 [2019-10-15 01:06:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:28,804 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-10-15 01:06:28,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:06:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-10-15 01:06:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:06:28,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:28,805 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:29,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:29,010 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1813865031, now seen corresponding path program 1 times [2019-10-15 01:06:29,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:29,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158497108] [2019-10-15 01:06:29,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:29,136 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,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158497108] [2019-10-15 01:06:29,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437968084] [2019-10-15 01:06:29,137 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:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:29,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 01:06:29,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:29,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-15 01:06:29,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:29,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:29,325 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:29,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-15 01:06:29,397 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:29,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:29,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:29,400 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:29,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-15 01:06:29,413 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:29,415 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:29,528 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:29,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:29,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-10-15 01:06:29,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852541602] [2019-10-15 01:06:29,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:06:29,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:29,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:06:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:06:29,531 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-10-15 01:06:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:29,719 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2019-10-15 01:06:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:06:29,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-10-15 01:06:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:29,721 INFO L225 Difference]: With dead ends: 67 [2019-10-15 01:06:29,722 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 01:06:29,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:06:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 01:06:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-15 01:06:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-15 01:06:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-10-15 01:06:29,730 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 29 [2019-10-15 01:06:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:29,730 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-10-15 01:06:29,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:06:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-10-15 01:06:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:06:29,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:29,735 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, 1] [2019-10-15 01:06:29,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:29,940 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:29,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1064113719, now seen corresponding path program 1 times [2019-10-15 01:06:29,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:29,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079072171] [2019-10-15 01:06:29,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:30,025 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,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079072171] [2019-10-15 01:06:30,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905269550] [2019-10-15 01:06:30,026 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,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:30,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 01:06:30,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:30,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-15 01:06:30,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:30,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:30,137 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,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-15 01:06:30,215 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:30,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:30,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:30,219 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,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-15 01:06:30,233 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:30,233 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:06:30,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:30,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-10-15 01:06:30,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643727406] [2019-10-15 01:06:30,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:06:30,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:06:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:06:30,344 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 7 states. [2019-10-15 01:06:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:30,532 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2019-10-15 01:06:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:06:30,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-15 01:06:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:30,534 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:06:30,534 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 01:06:30,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:06:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 01:06:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2019-10-15 01:06:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-15 01:06:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2019-10-15 01:06:30,543 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 30 [2019-10-15 01:06:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:30,543 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2019-10-15 01:06:30,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:06:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2019-10-15 01:06:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:06:30,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:30,544 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:30,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:30,752 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash -750507266, now seen corresponding path program 1 times [2019-10-15 01:06:30,753 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:30,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754922544] [2019-10-15 01:06:30,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:30,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:30,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:06:30,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754922544] [2019-10-15 01:06:30,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048227735] [2019-10-15 01:06:30,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:30,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 01:06:30,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:06:30,934 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:06:30,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [768300949] [2019-10-15 01:06:30,979 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-10-15 01:06:31,026 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:06:31,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:06:31,114 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:06:31,116 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 33 variables. [2019-10-15 01:06:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:31,122 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:06:31,166 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 01:06:31,167 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:06:31,168 INFO L553 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2019-10-15 01:06:31,169 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:06:31,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:06:31,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4, 5] total 8 [2019-10-15 01:06:31,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696685723] [2019-10-15 01:06:31,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:06:31,171 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:31,172 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:06:31,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:06:31,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:06:31,172 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 2 states. [2019-10-15 01:06:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:31,174 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2019-10-15 01:06:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:06:31,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-10-15 01:06:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:31,175 INFO L225 Difference]: With dead ends: 47 [2019-10-15 01:06:31,175 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:06:31,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:06:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:06:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:06:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:06:31,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-15 01:06:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:31,178 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:06:31,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:06:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:06:31,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:06:31,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:31,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:06:31,462 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,463 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:06:31,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,463 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:06:31,463 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:06:31,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,464 INFO L439 ceAbstractionStarter]: At program point L35-3(lines 35 43) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |main_~#input_string~0.base|))) (and (= main_~cont~0 0) (let ((.cse1 (mod main_~i~0 4294967296))) (or (and (= 0 (select .cse0 (+ .cse1 |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 .cse1)) (and (= 0 (select .cse0 (+ .cse1 |main_~#input_string~0.offset|))) (<= .cse1 2147483647)))) (= 0 main_~cont_aux~0) (= 0 (select .cse0 |main_~#input_string~0.offset|)))) [2019-10-15 01:06:31,464 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,464 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 47) no Hoare annotation was computed. [2019-10-15 01:06:31,465 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 20) no Hoare annotation was computed. [2019-10-15 01:06:31,465 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 20) the Hoare annotation is: false [2019-10-15 01:06:31,465 INFO L443 ceAbstractionStarter]: For program point L19-4(lines 19 20) no Hoare annotation was computed. [2019-10-15 01:06:31,465 INFO L443 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-10-15 01:06:31,465 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-10-15 01:06:31,465 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_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= main_~i~0 0)) [2019-10-15 01:06:31,466 INFO L443 ceAbstractionStarter]: For program point L28-4(lines 28 31) no Hoare annotation was computed. [2019-10-15 01:06:31,466 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 24 25) no Hoare annotation was computed. [2019-10-15 01:06:31,466 INFO L439 ceAbstractionStarter]: At program point L24-3(lines 24 25) the Hoare annotation is: false [2019-10-15 01:06:31,466 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 24 25) no Hoare annotation was computed. [2019-10-15 01:06:31,466 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-10-15 01:06:31,466 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 37 41) the Hoare annotation is: false [2019-10-15 01:06:31,466 INFO L443 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-10-15 01:06:31,466 INFO L443 ceAbstractionStarter]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2019-10-15 01:06:31,467 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2019-10-15 01:06:31,467 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-10-15 01:06:31,467 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 47) no Hoare annotation was computed. [2019-10-15 01:06:31,467 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-10-15 01:06:31,467 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 14 47) the Hoare annotation is: true [2019-10-15 01:06:31,467 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 40) no Hoare annotation was computed. [2019-10-15 01:06:31,467 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 35 43) no Hoare annotation was computed. [2019-10-15 01:06:31,468 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2019-10-15 01:06:31,468 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-15 01:06:31,468 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2019-10-15 01:06:31,468 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-10-15 01:06:31,468 INFO L443 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-10-15 01:06:31,468 INFO L443 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2019-10-15 01:06:31,478 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,486 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,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:06:31,488 INFO L168 Benchmark]: Toolchain (without parser) took 5171.02 ms. Allocated memory was 139.5 MB in the beginning and 244.3 MB in the end (delta: 104.9 MB). Free memory was 103.2 MB in the beginning and 114.5 MB in the end (delta: -11.3 MB). Peak memory consumption was 93.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,489 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 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,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.94 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 103.0 MB in the beginning and 183.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,491 INFO L168 Benchmark]: Boogie Preprocessor took 48.98 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,491 INFO L168 Benchmark]: RCFGBuilder took 447.95 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 162.0 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,492 INFO L168 Benchmark]: TraceAbstraction took 4281.26 ms. Allocated memory was 203.9 MB in the beginning and 244.3 MB in the end (delta: 40.4 MB). Free memory was 161.3 MB in the beginning and 114.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,497 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.25 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.94 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 103.0 MB in the beginning and 183.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.98 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 447.95 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 162.0 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4281.26 ms. Allocated memory was 203.9 MB in the beginning and 244.3 MB in the end (delta: 40.4 MB). Free memory was 161.3 MB in the beginning and 114.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 87.2 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: 6]: 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,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((n_caracter == 0 && cont == 0) && 0 == unknown-#memory_int-unknown[input_string][input_string]) && i == 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant [2019-10-15 01:06:31,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((cont == 0 && ((0 == unknown-#memory_int-unknown[input_string][i % 4294967296 + input_string + -4294967296] && 2147483647 < i % 4294967296) || (0 == unknown-#memory_int-unknown[input_string][i % 4294967296 + input_string] && i % 4294967296 <= 2147483647))) && 0 == cont_aux) && 0 == unknown-#memory_int-unknown[input_string][input_string] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 205 SDtfs, 151 SDslu, 519 SDs, 0 SdLazy, 186 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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, 7 MinimizatonAttempts, 65 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 18 PreInvPairs, 21 NumberOfFragments, 83 HoareAnnotationTreeSize, 18 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 31810 SizeOfPredicates, 19 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 45/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 143, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.925, AVG_VARS_REMOVED_DURING_WEAKENING: 1.0333333333333334, AVG_WEAKENED_CONJUNCTS: 0.2, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...