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/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:06:30,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:06:30,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:06:30,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:06:30,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:06:30,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:06:30,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:06:30,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:06:30,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:06:30,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:06:30,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:06:30,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:06:30,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:06:30,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:06:30,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:06:30,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:06:30,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:06:30,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:06:30,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:06:30,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:06:30,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:06:30,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:06:30,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:06:30,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:06:30,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:06:30,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:06:30,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:06:30,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:06:30,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:06:30,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:06:30,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:06:30,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:06:30,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:06:30,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:06:30,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:06:30,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:06:30,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:06:30,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:06:30,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:06:30,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:06:30,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:06:30,247 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-13 21:06:30,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:06:30,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:06:30,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:06:30,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:06:30,263 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:06:30,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:06:30,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:06:30,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:06:30,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:06:30,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:06:30,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:06:30,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:06:30,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:06:30,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:06:30,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:06:30,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:06:30,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:06:30,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:06:30,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:06:30,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:06:30,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:06:30,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:06:30,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:06:30,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:06:30,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:06:30,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:06:30,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:06:30,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:06:30,267 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-13 21:06:30,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:06:30,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:06:30,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:06:30,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:06:30,623 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:06:30,623 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-10-13 21:06:30,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c937cfe/cea4344f257d4cfb8344ff8525f409be/FLAG048f27367 [2019-10-13 21:06:31,161 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:06:31,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-10-13 21:06:31,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c937cfe/cea4344f257d4cfb8344ff8525f409be/FLAG048f27367 [2019-10-13 21:06:31,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c937cfe/cea4344f257d4cfb8344ff8525f409be [2019-10-13 21:06:31,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:06:31,541 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:06:31,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:31,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:06:31,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:06:31,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d5787d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31, skipping insertion in model container [2019-10-13 21:06:31,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:06:31,582 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:06:31,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:31,779 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:06:31,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:31,823 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:06:31,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31 WrapperNode [2019-10-13 21:06:31,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:31,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:06:31,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:06:31,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:06:31,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (1/1) ... [2019-10-13 21:06:31,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:06:31,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:06:31,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:06:31,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:06:31,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (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-13 21:06:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:06:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:06:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:06:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:06:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:06:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:06:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:06:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:06:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:06:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:06:32,276 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:06:32,276 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:06:32,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:32 BoogieIcfgContainer [2019-10-13 21:06:32,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:06:32,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:06:32,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:06:32,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:06:32,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:06:31" (1/3) ... [2019-10-13 21:06:32,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3661dc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:32, skipping insertion in model container [2019-10-13 21:06:32,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:31" (2/3) ... [2019-10-13 21:06:32,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3661dc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:32, skipping insertion in model container [2019-10-13 21:06:32,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:32" (3/3) ... [2019-10-13 21:06:32,288 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-10-13 21:06:32,302 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:06:32,312 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:06:32,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:06:32,351 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:06:32,352 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:06:32,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:06:32,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:06:32,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:06:32,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:06:32,353 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:06:32,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:06:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-13 21:06:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:06:32,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:32,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:32,403 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:32,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-10-13 21:06:32,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:32,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60335754] [2019-10-13 21:06:32,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:32,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:32,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:32,584 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-13 21:06:32,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60335754] [2019-10-13 21:06:32,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:32,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:06:32,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526616691] [2019-10-13 21:06:32,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:06:32,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:06:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:32,612 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-10-13 21:06:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:32,848 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2019-10-13 21:06:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:06:32,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:06:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:32,863 INFO L225 Difference]: With dead ends: 74 [2019-10-13 21:06:32,864 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 21:06:32,868 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-13 21:06:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 21:06:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-13 21:06:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-13 21:06:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-10-13 21:06:32,918 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-10-13 21:06:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:32,919 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-10-13 21:06:32,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:06:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-10-13 21:06:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:06:32,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:32,922 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-13 21:06:32,922 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-10-13 21:06:32,923 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:32,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256696562] [2019-10-13 21:06:32,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:32,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:32,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:33,125 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-13 21:06:33,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256696562] [2019-10-13 21:06:33,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:33,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:06:33,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763116533] [2019-10-13 21:06:33,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:06:33,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:33,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:06:33,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:06:33,132 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 12 states. [2019-10-13 21:06:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:33,335 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-10-13 21:06:33,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:06:33,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-10-13 21:06:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:33,338 INFO L225 Difference]: With dead ends: 54 [2019-10-13 21:06:33,338 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 21:06:33,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:06:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 21:06:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-13 21:06:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:06:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-13 21:06:33,355 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2019-10-13 21:06:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:33,356 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-13 21:06:33,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:06:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-13 21:06:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:06:33,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:33,358 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, 1] [2019-10-13 21:06:33,358 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash -880735776, now seen corresponding path program 1 times [2019-10-13 21:06:33,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:33,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361259686] [2019-10-13 21:06:33,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:33,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:33,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:33,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361259686] [2019-10-13 21:06:33,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:33,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:06:33,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260259761] [2019-10-13 21:06:33,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:06:33,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:06:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:33,421 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2019-10-13 21:06:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:33,483 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-10-13 21:06:33,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:06:33,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:06:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:33,486 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:06:33,486 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 21:06:33,487 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-13 21:06:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 21:06:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-13 21:06:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:06:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-10-13 21:06:33,493 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-10-13 21:06:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:33,494 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-10-13 21:06:33,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:06:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-10-13 21:06:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:06:33,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:33,495 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, 1] [2019-10-13 21:06:33,496 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:33,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-10-13 21:06:33,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:33,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219714692] [2019-10-13 21:06:33,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:33,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:33,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:33,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219714692] [2019-10-13 21:06:33,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362702925] [2019-10-13 21:06:33,682 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-13 21:06:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:33,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:06:33,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:33,801 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:34,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2097757099] [2019-10-13 21:06:34,096 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-10-13 21:06:34,151 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:06:34,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:06:34,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:06:34,361 INFO L272 AbstractInterpreter]: Visited 30 different actions 60 times. Merged at 6 different actions 17 times. Widened at 2 different actions 3 times. Performed 115 root evaluator evaluations with a maximum evaluation depth of 4. Performed 115 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 8 variables. [2019-10-13 21:06:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:34,368 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:06:34,368 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:06:34,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2019-10-13 21:06:34,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969338181] [2019-10-13 21:06:34,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:06:34,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:34,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:06:34,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:06:34,379 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 25 states. [2019-10-13 21:06:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:34,576 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-10-13 21:06:34,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:06:34,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-10-13 21:06:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:34,578 INFO L225 Difference]: With dead ends: 64 [2019-10-13 21:06:34,579 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 21:06:34,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:06:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 21:06:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-13 21:06:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:06:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-10-13 21:06:34,591 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 31 [2019-10-13 21:06:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:34,592 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-10-13 21:06:34,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:06:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-10-13 21:06:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:06:34,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:34,594 INFO L380 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 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-13 21:06:34,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:34,800 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2131135853, now seen corresponding path program 2 times [2019-10-13 21:06:34,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:34,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13524308] [2019-10-13 21:06:34,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:34,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:34,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:35,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13524308] [2019-10-13 21:06:35,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308254370] [2019-10-13 21:06:35,333 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:06:35,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:06:35,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:06:35,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:06:35,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-13 21:06:35,456 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-13 21:06:35,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [101601808] [2019-10-13 21:06:35,515 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:06:35,515 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:06:35,515 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:06:35,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 4, 4] total 31 [2019-10-13 21:06:35,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598205206] [2019-10-13 21:06:35,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:06:35,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:06:35,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:06:35,518 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 31 states. [2019-10-13 21:06:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:35,717 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-10-13 21:06:35,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:06:35,717 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-10-13 21:06:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:35,719 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:06:35,719 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:06:35,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:06:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:06:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-13 21:06:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:06:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-10-13 21:06:35,738 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 57 [2019-10-13 21:06:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:35,739 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-10-13 21:06:35,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:06:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-10-13 21:06:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 21:06:35,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:35,744 INFO L380 BasicCegarLoop]: trace histogram [20, 16, 4, 1, 1, 1, 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-13 21:06:35,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:35,949 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1841764251, now seen corresponding path program 3 times [2019-10-13 21:06:35,950 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:35,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573719335] [2019-10-13 21:06:35,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:35,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:35,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:36,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573719335] [2019-10-13 21:06:36,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322232280] [2019-10-13 21:06:36,572 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-13 21:06:36,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:06:36,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:06:36,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 21:06:36,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 119 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:06:36,652 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 119 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:06:37,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [271069297] [2019-10-13 21:06:37,593 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:06:37,593 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:06:37,594 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:06:37,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 28] total 52 [2019-10-13 21:06:37,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979662376] [2019-10-13 21:06:37,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-13 21:06:37,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-13 21:06:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:06:37,598 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 52 states. [2019-10-13 21:06:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:37,933 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2019-10-13 21:06:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-13 21:06:37,934 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 67 [2019-10-13 21:06:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:37,935 INFO L225 Difference]: With dead ends: 128 [2019-10-13 21:06:37,935 INFO L226 Difference]: Without dead ends: 118 [2019-10-13 21:06:37,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:06:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-13 21:06:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-13 21:06:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-13 21:06:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-10-13 21:06:37,949 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 67 [2019-10-13 21:06:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:37,950 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-10-13 21:06:37,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-13 21:06:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-10-13 21:06:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:06:37,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:37,952 INFO L380 BasicCegarLoop]: trace histogram [45, 41, 4, 1, 1, 1, 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-13 21:06:38,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:38,158 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:38,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:38,159 INFO L82 PathProgramCache]: Analyzing trace with hash 308351696, now seen corresponding path program 4 times [2019-10-13 21:06:38,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:38,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828723620] [2019-10-13 21:06:38,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:38,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:38,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:39,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828723620] [2019-10-13 21:06:39,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243495352] [2019-10-13 21:06:39,773 INFO L92 rtionOrderModulation]: Changing assertion order to 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-13 21:06:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:39,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-13 21:06:39,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:39,998 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:43,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [245426244] [2019-10-13 21:06:43,342 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:06:43,342 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:06:43,342 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:06:43,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 102 [2019-10-13 21:06:43,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661551224] [2019-10-13 21:06:43,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-10-13 21:06:43,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-10-13 21:06:43,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-13 21:06:43,348 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 102 states. [2019-10-13 21:06:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:44,270 INFO L93 Difference]: Finished difference Result 213 states and 259 transitions. [2019-10-13 21:06:44,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-13 21:06:44,271 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 117 [2019-10-13 21:06:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:44,274 INFO L225 Difference]: With dead ends: 213 [2019-10-13 21:06:44,274 INFO L226 Difference]: Without dead ends: 210 [2019-10-13 21:06:44,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 180 SyntacticMatches, 10 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-13 21:06:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-13 21:06:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-10-13 21:06:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-13 21:06:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-10-13 21:06:44,295 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 117 [2019-10-13 21:06:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:44,296 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-10-13 21:06:44,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-10-13 21:06:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-10-13 21:06:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-13 21:06:44,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:44,301 INFO L380 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 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-13 21:06:44,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:44,509 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 5 times [2019-10-13 21:06:44,510 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:44,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656365449] [2019-10-13 21:06:44,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:44,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:44,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-13 21:06:46,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656365449] [2019-10-13 21:06:46,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810287258] [2019-10-13 21:06:46,271 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:06:46,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2019-10-13 21:06:46,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:06:46,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-10-13 21:06:46,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:46,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:06:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-13 21:06:46,749 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-13 21:06:46,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1609490090] [2019-10-13 21:06:46,991 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:06:46,991 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:06:46,992 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:06:46,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-10-13 21:06:46,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642775892] [2019-10-13 21:06:46,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-13 21:06:46,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-13 21:06:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-10-13 21:06:46,996 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-10-13 21:06:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:48,980 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2019-10-13 21:06:48,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-13 21:06:48,981 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-10-13 21:06:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:48,983 INFO L225 Difference]: With dead ends: 216 [2019-10-13 21:06:48,983 INFO L226 Difference]: Without dead ends: 213 [2019-10-13 21:06:48,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 21:06:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-13 21:06:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-10-13 21:06:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-13 21:06:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-10-13 21:06:49,010 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-10-13 21:06:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:49,012 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-10-13 21:06:49,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-13 21:06:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-10-13 21:06:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-13 21:06:49,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:49,025 INFO L380 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 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-13 21:06:49,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:49,231 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 6 times [2019-10-13 21:06:49,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:49,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889883298] [2019-10-13 21:06:49,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:49,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:49,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-13 21:06:50,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889883298] [2019-10-13 21:06:50,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:50,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-10-13 21:06:50,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368131758] [2019-10-13 21:06:50,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-13 21:06:50,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-13 21:06:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:06:50,519 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-10-13 21:06:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:50,831 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-10-13 21:06:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-13 21:06:50,832 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-10-13 21:06:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:50,833 INFO L225 Difference]: With dead ends: 212 [2019-10-13 21:06:50,833 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:06:50,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:06:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:06:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:06:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:06:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:06:50,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-10-13 21:06:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:50,838 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:06:50,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-13 21:06:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:06:50,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:06:50,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:06:51,019 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 450 DAG size of output: 307 [2019-10-13 21:06:52,343 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-10-13 21:06:52,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:06:52,359 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:06:52,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:06:52,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:06:52,360 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:06:52,360 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:06:52,360 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:06:52,360 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2019-10-13 21:06:52,360 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 209) no Hoare annotation was computed. [2019-10-13 21:06:52,360 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2019-10-13 21:06:52,360 INFO L439 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 50 main_~main__y~0)) [2019-10-13 21:06:52,360 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2019-10-13 21:06:52,362 INFO L439 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (< main_~main__x~0 91) (<= 90 main_~main__x~0)) (and (< main_~main__x~0 96) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= 86 main_~main__x~0) (<= main_~main__y~0 86) (<= 86 main_~main__y~0) (< main_~main__x~0 87)) (and (<= 63 main_~main__x~0) (< main_~main__x~0 64) (<= main_~main__y~0 63) (<= 63 main_~main__y~0)) (and (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (< main_~main__x~0 79) (<= 78 main_~main__y~0)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (< main_~main__x~0 69) (<= 68 main_~main__y~0)) (and (< main_~main__x~0 80) (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__y~0 79)) (and (< main_~main__x~0 83) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0) (< main_~main__x~0 100)) (and (<= main_~main__y~0 80) (< main_~main__x~0 81) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= main_~main__y~0 83) (< main_~main__x~0 84) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0)) (and (< main_~main__x~0 95) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (< main_~main__x~0 99) (<= 98 main_~main__x~0)) (and (<= main_~main__y~0 65) (< main_~main__x~0 66) (<= 65 main_~main__y~0) (<= 65 main_~main__x~0)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= 87 main_~main__y~0) (< main_~main__x~0 88)) (and (<= main_~main__y~0 64) (< main_~main__x~0 65) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (< main_~main__x~0 94) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (< main_~main__x~0 67) (<= 66 main_~main__x~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= 70 main_~main__y~0) (< main_~main__x~0 71)) (and (< main_~main__x~0 75) (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= 74 main_~main__x~0)) (and (<= 75 main_~main__y~0) (< main_~main__x~0 76) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= 92 main_~main__x~0) (< main_~main__x~0 93) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (< main_~main__x~0 78) (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= 77 main_~main__x~0)) (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0) (< main_~main__x~0 59)) (and (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0) (< main_~main__x~0 70)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (< main_~main__x~0 85)) (and (< main_~main__x~0 58) (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0)) (and (< main_~main__x~0 97) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0) (< main_~main__x~0 92)) (and (< main_~main__x~0 72) (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0)) (and (<= 56 main_~main__x~0) (< main_~main__x~0 57) (<= main_~main__y~0 56) (<= 56 main_~main__y~0)) (and (< main_~main__x~0 61) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 76 main_~main__x~0) (<= main_~main__y~0 76) (<= 76 main_~main__y~0) (< main_~main__x~0 77)) (and (< main_~main__x~0 89) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (< main_~main__x~0 68) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= 59 main_~main__y~0) (< main_~main__x~0 60)) (and (<= 61 main_~main__y~0) (< main_~main__x~0 62) (<= 61 main_~main__x~0) (<= main_~main__y~0 61)) (and (<= 72 main_~main__x~0) (< main_~main__x~0 73) (<= main_~main__y~0 72) (<= 72 main_~main__y~0)) (and (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (< main_~main__x~0 74) (<= 73 main_~main__y~0)) (and (<= 89 main_~main__y~0) (< main_~main__x~0 90) (<= main_~main__y~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (< main_~main__x~0 63) (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0)) (and (<= main_~main__y~0 81) (< main_~main__x~0 82) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 85 main_~main__y~0) (< main_~main__x~0 86) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (< main_~main__x~0 98) (<= 97 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__y~0 55) (<= 55 main_~main__x~0) (< main_~main__x~0 56))) [2019-10-13 21:06:52,362 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2019-10-13 21:06:52,362 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2019-10-13 21:06:52,362 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2019-10-13 21:06:52,362 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2019-10-13 21:06:52,363 INFO L439 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 1)) [2019-10-13 21:06:52,363 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-13 21:06:52,363 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2019-10-13 21:06:52,363 INFO L439 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2)) [2019-10-13 21:06:52,363 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-13 21:06:52,363 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2019-10-13 21:06:52,363 INFO L439 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 3)) [2019-10-13 21:06:52,363 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 209) no Hoare annotation was computed. [2019-10-13 21:06:52,363 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2019-10-13 21:06:52,363 INFO L439 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2019-10-13 21:06:52,364 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 209) the Hoare annotation is: true [2019-10-13 21:06:52,364 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2019-10-13 21:06:52,364 INFO L439 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 50 main_~main__y~0)) [2019-10-13 21:06:52,364 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2019-10-13 21:06:52,364 INFO L439 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2019-10-13 21:06:52,364 INFO L439 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 50 main_~main__y~0)) [2019-10-13 21:06:52,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:06:52 BoogieIcfgContainer [2019-10-13 21:06:52,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:06:52,395 INFO L168 Benchmark]: Toolchain (without parser) took 20853.66 ms. Allocated memory was 136.8 MB in the beginning and 444.1 MB in the end (delta: 307.2 MB). Free memory was 100.4 MB in the beginning and 198.3 MB in the end (delta: -97.8 MB). Peak memory consumption was 324.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:52,396 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-13 21:06:52,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.49 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 89.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:52,397 INFO L168 Benchmark]: Boogie Preprocessor took 117.60 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 89.3 MB in the beginning and 178.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:52,398 INFO L168 Benchmark]: RCFGBuilder took 336.00 ms. Allocated memory is still 200.3 MB. Free memory was 178.6 MB in the beginning and 162.0 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:52,399 INFO L168 Benchmark]: TraceAbstraction took 20113.20 ms. Allocated memory was 200.3 MB in the beginning and 444.1 MB in the end (delta: 243.8 MB). Free memory was 162.0 MB in the beginning and 198.3 MB in the end (delta: -36.2 MB). Peak memory consumption was 322.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:52,403 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.28 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.49 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 89.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.60 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 89.3 MB in the beginning and 178.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 336.00 ms. Allocated memory is still 200.3 MB. Free memory was 178.6 MB in the beginning and 162.0 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20113.20 ms. Allocated memory was 200.3 MB in the beginning and 444.1 MB in the end (delta: 243.8 MB). Free memory was 162.0 MB in the beginning and 198.3 MB in the end (delta: -36.2 MB). Peak memory consumption was 322.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 8) && 50 <= main__y - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 7) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 2 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 5) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main__y <= 90 && 90 <= main__y) && main__x < 91) && 90 <= main__x) || (((main__x < 96 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((86 <= main__x && main__y <= 86) && 86 <= main__y) && main__x < 87)) || (((63 <= main__x && main__x < 64) && main__y <= 63) && 63 <= main__y)) || (((main__y <= 78 && 78 <= main__x) && main__x < 79) && 78 <= main__y)) || (((main__y <= 68 && 68 <= main__x) && main__x < 69) && 68 <= main__y)) || (((main__x < 80 && 79 <= main__x) && 79 <= main__y) && main__y <= 79)) || (((main__x < 83 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((99 <= main__x && main__y <= 99) && 99 <= main__y) && main__x < 100)) || (((main__y <= 80 && main__x < 81) && 80 <= main__x) && 80 <= main__y)) || (((main__y <= 83 && main__x < 84) && 83 <= main__x) && 83 <= main__y)) || (((main__x < 95 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((main__y <= 98 && 98 <= main__y) && main__x < 99) && 98 <= main__x)) || (((main__y <= 65 && main__x < 66) && 65 <= main__y) && 65 <= main__x)) || (((87 <= main__x && main__y <= 87) && 87 <= main__y) && main__x < 88)) || (((main__y <= 64 && main__x < 65) && 64 <= main__x) && 64 <= main__y)) || (((main__x < 94 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((main__y <= 66 && 66 <= main__y) && main__x < 67) && 66 <= main__x)) || (((70 <= main__x && main__y <= 70) && 70 <= main__y) && main__x < 71)) || (((main__x < 75 && main__y <= 74) && 74 <= main__y) && 74 <= main__x)) || (((75 <= main__y && main__x < 76) && 75 <= main__x) && main__y <= 75)) || (((92 <= main__x && main__x < 93) && main__y <= 92) && 92 <= main__y)) || (((main__x < 78 && main__y <= 77) && 77 <= main__y) && 77 <= main__x)) || ((main__y <= 100 && 100 <= main__x) && 100 <= main__y)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((main__y <= 58 && 58 <= main__x) && 58 <= main__y) && main__x < 59)) || (((main__y <= 69 && 69 <= main__y) && 69 <= main__x) && main__x < 70)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x < 85)) || (((main__x < 58 && 57 <= main__y) && main__y <= 57) && 57 <= main__x)) || (((main__x < 97 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((91 <= main__x && main__y <= 91) && 91 <= main__y) && main__x < 92)) || (((main__x < 72 && main__y <= 71) && 71 <= main__y) && 71 <= main__x)) || (((56 <= main__x && main__x < 57) && main__y <= 56) && 56 <= main__y)) || (((main__x < 61 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((76 <= main__x && main__y <= 76) && 76 <= main__y) && main__x < 77)) || (((main__x < 89 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__x < 68 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((59 <= main__x && main__y <= 59) && 59 <= main__y) && main__x < 60)) || (((61 <= main__y && main__x < 62) && 61 <= main__x) && main__y <= 61)) || (((72 <= main__x && main__x < 73) && main__y <= 72) && 72 <= main__y)) || (((73 <= main__x && main__y <= 73) && main__x < 74) && 73 <= main__y)) || (((89 <= main__y && main__x < 90) && main__y <= 89) && 89 <= main__x)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((main__x < 63 && 62 <= main__y) && main__y <= 62) && 62 <= main__x)) || (((main__y <= 81 && main__x < 82) && 81 <= main__x) && 81 <= main__y)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((85 <= main__y && main__x < 86) && 85 <= main__x) && main__y <= 85)) || (((main__y <= 97 && 97 <= main__x) && main__x < 98) && 97 <= main__y)) || (((55 <= main__y && main__y <= 55) && 55 <= main__x) && main__x < 56) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Result: SAFE, OverallTime: 20.0s, OverallIterations: 9, TraceHistogramMax: 92, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 193 SDtfs, 552 SDslu, 4091 SDs, 0 SdLazy, 4137 SolverSat, 1241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1212 GetRequests, 876 SyntacticMatches, 18 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 113 NumberOfFragments, 742 HoareAnnotationTreeSize, 13 FomulaSimplifications, 626 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1256 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 1718 ConstructedInterpolants, 0 QuantifiedInterpolants, 1146068 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1114 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 14339/41270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...