/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/array-tiling/nr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:27:46,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:27:46,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:27:46,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:27:46,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:27:46,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:27:46,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:27:46,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:27:46,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:27:46,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:27:46,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:27:46,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:27:46,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:27:46,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:27:46,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:27:46,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:27:46,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:27:46,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:27:46,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:27:46,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:27:46,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:27:46,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:27:46,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:27:46,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:27:46,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:27:46,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:27:46,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:27:46,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:27:46,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:27:46,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:27:46,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:27:46,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:27:46,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:27:46,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:27:46,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:27:46,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:27:46,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:27:46,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:27:46,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:27:46,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:27:46,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:27:46,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:27:46,512 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:27:46,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:27:46,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:27:46,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:27:46,514 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:27:46,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:27:46,515 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:27:46,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:27:46,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:27:46,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:27:46,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:27:46,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:27:46,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:27:46,516 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:27:46,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:27:46,516 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:27:46,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:27:46,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:27:46,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:27:46,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:27:46,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:27:46,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:27:46,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:27:46,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:27:46,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:27:46,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:27:46,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:27:46,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:27:46,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:27:46,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:27:46,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:27:46,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:27:46,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:27:46,819 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:27:46,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr2.c [2019-11-06 22:27:46,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5efbbf8/11f66357cf994071ad5e2b4d13024c10/FLAGe6df15fb9 [2019-11-06 22:27:47,361 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:27:47,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr2.c [2019-11-06 22:27:47,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5efbbf8/11f66357cf994071ad5e2b4d13024c10/FLAGe6df15fb9 [2019-11-06 22:27:47,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5efbbf8/11f66357cf994071ad5e2b4d13024c10 [2019-11-06 22:27:47,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:27:47,748 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:27:47,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:47,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:27:47,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:27:47,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:47" (1/1) ... [2019-11-06 22:27:47,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473fe89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:47, skipping insertion in model container [2019-11-06 22:27:47,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:47" (1/1) ... [2019-11-06 22:27:47,765 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:27:47,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:27:47,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:47,983 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:27:48,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:48,024 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:27:48,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48 WrapperNode [2019-11-06 22:27:48,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:48,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:27:48,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:27:48,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:27:48,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... [2019-11-06 22:27:48,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... [2019-11-06 22:27:48,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... [2019-11-06 22:27:48,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... [2019-11-06 22:27:48,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... [2019-11-06 22:27:48,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... [2019-11-06 22:27:48,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... [2019-11-06 22:27:48,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:27:48,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:27:48,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:27:48,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:27:48,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:27:48,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:27:48,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:27:48,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 22:27:48,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:27:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:27:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:27:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 22:27:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:27:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:27:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 22:27:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:27:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:27:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:27:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:27:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:27:48,512 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:27:48,513 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 22:27:48,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:48 BoogieIcfgContainer [2019-11-06 22:27:48,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:27:48,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:27:48,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:27:48,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:27:48,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:47" (1/3) ... [2019-11-06 22:27:48,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b83b1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:48, skipping insertion in model container [2019-11-06 22:27:48,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:48" (2/3) ... [2019-11-06 22:27:48,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b83b1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:48, skipping insertion in model container [2019-11-06 22:27:48,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:48" (3/3) ... [2019-11-06 22:27:48,531 INFO L109 eAbstractionObserver]: Analyzing ICFG nr2.c [2019-11-06 22:27:48,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:27:48,576 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:27:48,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:27:48,618 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:27:48,618 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:27:48,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:27:48,618 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:27:48,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:27:48,619 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:27:48,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:27:48,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:27:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-06 22:27:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:27:48,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:48,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:48,642 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-11-06 22:27:48,654 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:48,654 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115263585] [2019-11-06 22:27:48,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:48,866 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115263585] [2019-11-06 22:27:48,867 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:48,868 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:27:48,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488558518] [2019-11-06 22:27:48,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:27:48,875 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:48,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:27:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:27:48,890 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2019-11-06 22:27:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:48,963 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-11-06 22:27:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:27:48,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 22:27:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:48,979 INFO L225 Difference]: With dead ends: 60 [2019-11-06 22:27:48,979 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 22:27:48,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:27:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 22:27:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-06 22:27:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 22:27:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-06 22:27:49,021 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-11-06 22:27:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:49,021 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-06 22:27:49,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:27:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-06 22:27:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:27:49,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:49,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:49,024 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:49,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-11-06 22:27:49,024 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:49,025 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038872908] [2019-11-06 22:27:49,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:49,129 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038872908] [2019-11-06 22:27:49,129 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:49,132 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:27:49,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865569906] [2019-11-06 22:27:49,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:27:49,134 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:27:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:27:49,135 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-11-06 22:27:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:49,200 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-11-06 22:27:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:27:49,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-06 22:27:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:49,204 INFO L225 Difference]: With dead ends: 52 [2019-11-06 22:27:49,205 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 22:27:49,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-06 22:27:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 22:27:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-06 22:27:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 22:27:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 22:27:49,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-11-06 22:27:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:49,215 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 22:27:49,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:27:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 22:27:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 22:27:49,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:49,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:49,216 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:49,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-11-06 22:27:49,217 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:49,218 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202796665] [2019-11-06 22:27:49,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:49,281 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202796665] [2019-11-06 22:27:49,281 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:49,281 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:27:49,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745455494] [2019-11-06 22:27:49,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:27:49,282 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:27:49,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:27:49,284 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2019-11-06 22:27:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:49,321 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-11-06 22:27:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:27:49,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 22:27:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:49,323 INFO L225 Difference]: With dead ends: 56 [2019-11-06 22:27:49,323 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 22:27:49,326 INFO L630 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-11-06 22:27:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 22:27:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-06 22:27:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 22:27:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-06 22:27:49,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-11-06 22:27:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:49,338 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-06 22:27:49,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:27:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-06 22:27:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:27:49,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:49,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:49,343 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-11-06 22:27:49,344 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:49,345 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778372685] [2019-11-06 22:27:49,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:49,423 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778372685] [2019-11-06 22:27:49,423 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:49,423 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:27:49,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390838180] [2019-11-06 22:27:49,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:27:49,424 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:49,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:27:49,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:27:49,425 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-11-06 22:27:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:49,468 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-06 22:27:49,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:27:49,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-06 22:27:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:49,470 INFO L225 Difference]: With dead ends: 57 [2019-11-06 22:27:49,470 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 22:27:49,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:27:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 22:27:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-06 22:27:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 22:27:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 22:27:49,478 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-11-06 22:27:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:49,479 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 22:27:49,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:27:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 22:27:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:27:49,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:49,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:49,481 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-11-06 22:27:49,482 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:49,482 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385759473] [2019-11-06 22:27:49,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:49,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385759473] [2019-11-06 22:27:49,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730086136] [2019-11-06 22:27:49,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:27:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:49,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:27:49,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:27:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:49,635 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:27:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:49,659 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [413687928] [2019-11-06 22:27:49,668 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-11-06 22:27:49,725 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:27:49,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:27:49,809 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:27:49,811 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 23 root evaluator evaluations with a maximum evaluation depth of 2. Performed 23 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 26 variables. [2019-11-06 22:27:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:49,817 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:27:49,856 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 96.67% of their original sizes. [2019-11-06 22:27:49,856 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:27:49,861 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-11-06 22:27:49,861 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:27:49,862 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:27:49,862 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4] total 5 [2019-11-06 22:27:49,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034986881] [2019-11-06 22:27:49,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:27:49,863 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:49,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:27:49,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:27:49,864 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-11-06 22:27:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:27:50,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:27:50,070 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 529#true or 695#(and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) ([#1{~CELLCOUNT~0 = [-2147483648;2147483647]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-06 22:27:50,076 INFO L168 Benchmark]: Toolchain (without parser) took 2326.76 ms. Allocated memory was 137.9 MB in the beginning and 234.4 MB in the end (delta: 96.5 MB). Free memory was 101.8 MB in the beginning and 196.4 MB in the end (delta: -94.6 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:50,079 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-06 22:27:50,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.55 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:50,081 INFO L168 Benchmark]: Boogie Preprocessor took 121.42 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.4 MB in the beginning and 180.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:50,082 INFO L168 Benchmark]: RCFGBuilder took 368.37 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 163.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:50,083 INFO L168 Benchmark]: TraceAbstraction took 1556.99 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 163.7 MB in the beginning and 196.4 MB in the end (delta: -32.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:27:50,091 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.55 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.42 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.4 MB in the beginning and 180.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.37 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 163.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1556.99 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 163.7 MB in the beginning and 196.4 MB in the end (delta: -32.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 529#true or 695#(and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) ([#1{~CELLCOUNT~0 = [-2147483648;2147483647]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 529#true or 695#(and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) ([#1{~CELLCOUNT~0 = [-2147483648;2147483647]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...