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/array-tiling/pnr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:52:50,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:52:50,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:52:50,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:52:50,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:52:50,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:52:50,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:52:50,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:52:50,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:52:50,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:52:50,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:52:50,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:52:50,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:52:50,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:52:50,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:52:50,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:52:50,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:52:50,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:52:50,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:52:50,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:52:50,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:52:50,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:52:50,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:52:50,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:52:50,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:52:50,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:52:50,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:52:50,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:52:50,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:52:50,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:52:50,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:52:50,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:52:50,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:52:50,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:52:50,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:52:50,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:52:50,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:52:50,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:52:50,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:52:50,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:52:50,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:52:50,358 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-14 23:52:50,390 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:52:50,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:52:50,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:52:50,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:52:50,395 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:52:50,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:52:50,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:52:50,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:52:50,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:52:50,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:52:50,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:52:50,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:52:50,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:52:50,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:52:50,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:52:50,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:52:50,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:52:50,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:52:50,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:52:50,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:52:50,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:52:50,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:50,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:52:50,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:52:50,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:52:50,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:52:50,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:52:50,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:52:50,404 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-14 23:52:50,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:52:50,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:52:50,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:52:50,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:52:50,701 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:52:50,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr3.c [2019-10-14 23:52:50,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c88b8c2/587e10f83966489d83bc5688bba405b7/FLAG5e25ebb11 [2019-10-14 23:52:51,230 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:52:51,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr3.c [2019-10-14 23:52:51,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c88b8c2/587e10f83966489d83bc5688bba405b7/FLAG5e25ebb11 [2019-10-14 23:52:51,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c88b8c2/587e10f83966489d83bc5688bba405b7 [2019-10-14 23:52:51,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:52:51,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:52:51,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:51,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:52:51,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:52:51,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1bb9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51, skipping insertion in model container [2019-10-14 23:52:51,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,574 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:52:51,595 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:52:51,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:51,778 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:52:51,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:51,817 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:52:51,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51 WrapperNode [2019-10-14 23:52:51,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:51,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:52:51,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:52:51,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:52:51,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:52:51,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:52:51,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:52:51,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:52:51,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (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-14 23:52:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:52:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:52:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:52:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-10-14 23:52:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:52:52,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:52:52,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:52:52,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:52:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:52:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:52:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-10-14 23:52:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:52:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:52:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:52:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:52:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:52:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:52:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:52:52,378 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:52:52,379 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:52:52,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:52 BoogieIcfgContainer [2019-10-14 23:52:52,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:52:52,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:52:52,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:52:52,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:52:52,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:52:51" (1/3) ... [2019-10-14 23:52:52,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3436e5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:52, skipping insertion in model container [2019-10-14 23:52:52,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (2/3) ... [2019-10-14 23:52:52,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3436e5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:52, skipping insertion in model container [2019-10-14 23:52:52,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:52" (3/3) ... [2019-10-14 23:52:52,396 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr3.c [2019-10-14 23:52:52,407 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:52:52,415 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:52:52,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:52:52,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:52:52,462 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:52:52,462 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:52:52,462 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:52:52,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:52:52,463 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:52:52,463 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:52:52,463 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:52:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-14 23:52:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:52:52,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,494 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:52,496 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash 342601179, now seen corresponding path program 1 times [2019-10-14 23:52:52,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864192289] [2019-10-14 23:52:52,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,649 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-14 23:52:52,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864192289] [2019-10-14 23:52:52,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:52:52,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229439685] [2019-10-14 23:52:52,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:52:52,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:52:52,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:52,670 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-10-14 23:52:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,693 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-14 23:52:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:52:52,694 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-14 23:52:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,703 INFO L225 Difference]: With dead ends: 54 [2019-10-14 23:52:52,703 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 23:52:52,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 23:52:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-14 23:52:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:52:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-14 23:52:52,753 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 15 [2019-10-14 23:52:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,754 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-14 23:52:52,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:52:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-10-14 23:52:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:52:52,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,757 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:52,757 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash 374798206, now seen corresponding path program 1 times [2019-10-14 23:52:52,758 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102441208] [2019-10-14 23:52:52,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:53,035 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-14 23:52:53,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102441208] [2019-10-14 23:52:53,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:53,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:53,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711004195] [2019-10-14 23:52:53,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:53,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:53,041 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2019-10-14 23:52:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:53,172 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-10-14 23:52:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:53,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-14 23:52:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:53,175 INFO L225 Difference]: With dead ends: 55 [2019-10-14 23:52:53,175 INFO L226 Difference]: Without dead ends: 44 [2019-10-14 23:52:53,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-14 23:52:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2019-10-14 23:52:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 23:52:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-14 23:52:53,188 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 15 [2019-10-14 23:52:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:53,188 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-14 23:52:53,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-14 23:52:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:52:53,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:53,190 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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-14 23:52:53,191 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 919940654, now seen corresponding path program 1 times [2019-10-14 23:52:53,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:53,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086952910] [2019-10-14 23:52:53,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:53,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:53,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:52:53,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086952910] [2019-10-14 23:52:53,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233585671] [2019-10-14 23:52:53,559 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-14 23:52:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:53,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 23:52:53,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:53,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 23:52:53,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:53,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-14 23:52:53,845 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-14 23:52:53,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-10-14 23:52:53,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:53,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-14 23:52:53,878 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-14 23:52:53,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-10-14 23:52:53,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:53,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-10-14 23:52:53,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-14 23:52:53,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:53,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:53,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-10-14 23:52:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:52:53,961 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:54,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-10-14 23:52:54,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-10-14 23:52:54,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:54,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:54,043 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:54,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:54,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:52:54,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:8 [2019-10-14 23:52:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:52:54,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1563543324] [2019-10-14 23:52:54,077 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 36 [2019-10-14 23:52:54,123 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:52:54,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:52:54,211 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:52:54,216 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2019-10-14 23:52:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:54,225 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:52:54,271 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:52:54,271 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:52:54,283 INFO L553 sIntCurrentIteration]: We unified 34 AI predicates to 34 [2019-10-14 23:52:54,283 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:52:54,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:52:54,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 9, 8] total 19 [2019-10-14 23:52:54,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796440113] [2019-10-14 23:52:54,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:54,286 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:54,286 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:52:54,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:54,287 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 4 states. [2019-10-14 23:52:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:54,292 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-14 23:52:54,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:54,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-14 23:52:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:54,292 INFO L225 Difference]: With dead ends: 34 [2019-10-14 23:52:54,292 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:52:54,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:52:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:52:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:52:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:52:54,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-10-14 23:52:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:54,295 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:52:54,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:52:54,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:52:54,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:54,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:52:54,593 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:54,594 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:54,594 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:54,594 INFO L446 ceAbstractionStarter]: At program point ReadFromPortENTRY(lines 7 11) the Hoare annotation is: true [2019-10-14 23:52:54,594 INFO L443 ceAbstractionStarter]: For program point ReadFromPortFINAL(lines 7 11) no Hoare annotation was computed. [2019-10-14 23:52:54,594 INFO L443 ceAbstractionStarter]: For program point ReadFromPortEXIT(lines 7 11) no Hoare annotation was computed. [2019-10-14 23:52:54,594 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:54,594 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) [2019-10-14 23:52:54,595 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:54,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:54,595 INFO L443 ceAbstractionStarter]: For program point L64-2(lines 64 67) no Hoare annotation was computed. [2019-10-14 23:52:54,595 INFO L443 ceAbstractionStarter]: For program point L31-2(lines 31 62) no Hoare annotation was computed. [2019-10-14 23:52:54,595 INFO L439 ceAbstractionStarter]: At program point L64-3(lines 64 67) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:52:54,595 INFO L439 ceAbstractionStarter]: At program point L31-3(lines 31 62) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:52:54,595 INFO L443 ceAbstractionStarter]: For program point L31-4(lines 31 62) no Hoare annotation was computed. [2019-10-14 23:52:54,595 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 70) no Hoare annotation was computed. [2019-10-14 23:52:54,596 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 51) no Hoare annotation was computed. [2019-10-14 23:52:54,596 INFO L439 ceAbstractionStarter]: At program point L44-2(lines 44 51) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:52:54,596 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-14 23:52:54,596 INFO L443 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-10-14 23:52:54,596 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 68) no Hoare annotation was computed. [2019-10-14 23:52:54,596 INFO L443 ceAbstractionStarter]: For program point L20-1(lines 20 68) no Hoare annotation was computed. [2019-10-14 23:52:54,596 INFO L439 ceAbstractionStarter]: At program point L66(line 66) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:52:54,596 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:52:54,596 INFO L443 ceAbstractionStarter]: For program point L66-1(line 66) no Hoare annotation was computed. [2019-10-14 23:52:54,597 INFO L443 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2019-10-14 23:52:54,597 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 61) no Hoare annotation was computed. [2019-10-14 23:52:54,597 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 70) no Hoare annotation was computed. [2019-10-14 23:52:54,597 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 41) no Hoare annotation was computed. [2019-10-14 23:52:54,597 INFO L439 ceAbstractionStarter]: At program point L34-2(lines 34 41) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:52:54,597 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 17 70) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648))) (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647))) [2019-10-14 23:52:54,597 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-14 23:52:54,597 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:54,598 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:52:54,598 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:52:54,598 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:54,598 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:52:54,598 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:52:54,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:52:54 BoogieIcfgContainer [2019-10-14 23:52:54,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:52:54,616 INFO L168 Benchmark]: Toolchain (without parser) took 3059.34 ms. Allocated memory was 145.8 MB in the beginning and 234.4 MB in the end (delta: 88.6 MB). Free memory was 103.3 MB in the beginning and 123.6 MB in the end (delta: -20.3 MB). Peak memory consumption was 68.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:54,617 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:52:54,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.84 ms. Allocated memory is still 145.8 MB. Free memory was 103.1 MB in the beginning and 92.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:54,619 INFO L168 Benchmark]: Boogie Preprocessor took 153.57 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 92.5 MB in the beginning and 181.5 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:54,620 INFO L168 Benchmark]: RCFGBuilder took 408.65 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 163.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:54,621 INFO L168 Benchmark]: TraceAbstraction took 2232.98 ms. Allocated memory was 203.9 MB in the beginning and 234.4 MB in the end (delta: 30.4 MB). Free memory was 163.3 MB in the beginning and 123.6 MB in the end (delta: 39.7 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:54,625 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 259.84 ms. Allocated memory is still 145.8 MB. Free memory was 103.1 MB in the beginning and 92.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.57 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 92.5 MB in the beginning and 181.5 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.65 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 163.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2232.98 ms. Allocated memory was 203.9 MB in the beginning and 234.4 MB in the end (delta: 30.4 MB). Free memory was 163.3 MB in the beginning and 123.6 MB in the end (delta: 39.7 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 31]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 46 SDslu, 20 SDs, 0 SdLazy, 39 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 16 NumberOfFragments, 130 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 19098 SizeOfPredicates, 19 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 27/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 148, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9669117647058824, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9117647058823529, AVG_WEAKENED_CONJUNCTS: 0.6470588235294118, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...