/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/pr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:27:57,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:27:57,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:27:57,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:27:57,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:27:57,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:27:57,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:27:57,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:27:57,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:27:57,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:27:57,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:27:57,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:27:57,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:27:57,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:27:57,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:27:57,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:27:57,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:27:57,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:27:57,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:27:57,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:27:57,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:27:57,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:27:57,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:27:57,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:27:57,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:27:57,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:27:57,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:27:57,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:27:57,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:27:57,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:27:57,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:27:57,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:27:57,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:27:57,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:27:57,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:27:57,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:27:57,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:27:57,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:27:57,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:27:57,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:27:57,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:27:57,844 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:57,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:27:57,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:27:57,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:27:57,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:27:57,859 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:27:57,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:27:57,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:27:57,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:27:57,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:27:57,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:27:57,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:27:57,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:27:57,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:27:57,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:27:57,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:27:57,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:27:57,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:27:57,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:27:57,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:27:57,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:27:57,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:27:57,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:27:57,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:27:57,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:27:57,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:27:57,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:27:57,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:27:57,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:27:57,868 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:58,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:27:58,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:27:58,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:27:58,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:27:58,168 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:27:58,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr5.c [2019-11-06 22:27:58,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dca9e72/9951af4a2de94766a6144af0fd561c08/FLAGa51a030d2 [2019-11-06 22:27:58,670 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:27:58,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr5.c [2019-11-06 22:27:58,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dca9e72/9951af4a2de94766a6144af0fd561c08/FLAGa51a030d2 [2019-11-06 22:27:59,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dca9e72/9951af4a2de94766a6144af0fd561c08 [2019-11-06 22:27:59,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:27:59,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:27:59,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:59,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:27:59,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:27:59,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:59" (1/1) ... [2019-11-06 22:27:59,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269186a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:59, skipping insertion in model container [2019-11-06 22:27:59,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:59" (1/1) ... [2019-11-06 22:27:59,095 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:27:59,120 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:27:59,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:59,366 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:27:59,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:59,498 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:27:59,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:59 WrapperNode [2019-11-06 22:27:59,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:59,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:27:59,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:27:59,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:27:59,513 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:59" (1/1) ... [2019-11-06 22:27:59,513 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:59" (1/1) ... [2019-11-06 22:27:59,520 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:59" (1/1) ... [2019-11-06 22:27:59,521 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:59" (1/1) ... [2019-11-06 22:27:59,530 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:59" (1/1) ... [2019-11-06 22:27:59,535 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:59" (1/1) ... [2019-11-06 22:27:59,537 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:59" (1/1) ... [2019-11-06 22:27:59,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:27:59,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:27:59,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:27:59,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:27:59,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:59" (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:59,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:27:59,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:27:59,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 22:27:59,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:27:59,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 22:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 22:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:27:59,931 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:27:59,932 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 22:27:59,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:59 BoogieIcfgContainer [2019-11-06 22:27:59,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:27:59,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:27:59,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:27:59,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:27:59,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:59" (1/3) ... [2019-11-06 22:27:59,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5742d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:59, skipping insertion in model container [2019-11-06 22:27:59,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:59" (2/3) ... [2019-11-06 22:27:59,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5742d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:59, skipping insertion in model container [2019-11-06 22:27:59,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:59" (3/3) ... [2019-11-06 22:27:59,940 INFO L109 eAbstractionObserver]: Analyzing ICFG pr5.c [2019-11-06 22:27:59,950 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:27:59,957 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:27:59,968 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:27:59,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:27:59,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:27:59,999 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:27:59,999 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:27:59,999 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:27:59,999 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:27:59,999 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:27:59,999 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:28:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-06 22:28:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:28:00,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:00,029 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:28:00,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash 65656709, now seen corresponding path program 1 times [2019-11-06 22:28:00,041 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:00,041 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896592733] [2019-11-06 22:28:00,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:00,248 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:28:00,248 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896592733] [2019-11-06 22:28:00,249 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:00,250 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:28:00,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114515907] [2019-11-06 22:28:00,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:28:00,256 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:28:00,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:28:00,270 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-11-06 22:28:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:00,353 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-11-06 22:28:00,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:28:00,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 22:28:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:00,366 INFO L225 Difference]: With dead ends: 57 [2019-11-06 22:28:00,367 INFO L226 Difference]: Without dead ends: 33 [2019-11-06 22:28:00,370 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:28:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-06 22:28:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-06 22:28:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 22:28:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-06 22:28:00,407 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 16 [2019-11-06 22:28:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:00,408 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-06 22:28:00,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:28:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-06 22:28:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:28:00,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:00,410 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:28:00,410 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash 67503751, now seen corresponding path program 1 times [2019-11-06 22:28:00,411 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:00,411 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495020093] [2019-11-06 22:28:00,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:00,613 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:28:00,616 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495020093] [2019-11-06 22:28:00,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:00,617 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:28:00,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773332580] [2019-11-06 22:28:00,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:28:00,621 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:28:00,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:28:00,622 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-11-06 22:28:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:00,754 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-11-06 22:28:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:28:00,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-06 22:28:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:00,758 INFO L225 Difference]: With dead ends: 56 [2019-11-06 22:28:00,758 INFO L226 Difference]: Without dead ends: 39 [2019-11-06 22:28:00,760 INFO L630 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-11-06 22:28:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-06 22:28:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-06 22:28:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 22:28:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-06 22:28:00,768 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2019-11-06 22:28:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:00,769 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-06 22:28:00,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:28:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-06 22:28:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 22:28:00,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:00,770 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, 1] [2019-11-06 22:28:00,771 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:00,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash -335534155, now seen corresponding path program 1 times [2019-11-06 22:28:00,772 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:00,772 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499978026] [2019-11-06 22:28:00,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:28:01,187 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499978026] [2019-11-06 22:28:01,187 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240418758] [2019-11-06 22:28:01,187 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:28:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:01,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-06 22:28:01,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:28:01,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 22:28:01,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 22:28:01,381 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-11-06 22:28:01,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-06 22:28:01,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,403 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-11-06 22:28:01,439 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-11-06 22:28:01,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-06 22:28:01,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,462 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,491 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-11-06 22:28:01,520 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-11-06 22:28:01,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-06 22:28:01,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,551 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,564 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-11-06 22:28:01,584 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-06 22:28:01,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:28:01,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-11-06 22:28:01,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,609 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2019-11-06 22:28:01,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:28:01,685 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:28:01,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,803 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 17 treesize of output 15 [2019-11-06 22:28:01,809 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 26 treesize of output 24 [2019-11-06 22:28:01,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,812 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:01,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:01,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:8 [2019-11-06 22:28:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:28:01,837 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [280383485] [2019-11-06 22:28:01,844 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24 [2019-11-06 22:28:01,887 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:28:01,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:28:02,000 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:28:02,011 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 21 root evaluator evaluations with a maximum evaluation depth of 2. Performed 21 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 28 variables. [2019-11-06 22:28:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:02,022 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:28:02,092 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 96.67% of their original sizes. [2019-11-06 22:28:02,092 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:28:02,101 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-11-06 22:28:02,101 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:28:02,102 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:28:02,102 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 8, 6] total 15 [2019-11-06 22:28:02,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760608464] [2019-11-06 22:28:02,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:28:02,106 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:28:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:28:02,108 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 3 states. [2019-11-06 22:28:02,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:28:02,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:28:02,318 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: 275#true or 458#(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:28:02,324 INFO L168 Benchmark]: Toolchain (without parser) took 3245.79 ms. Allocated memory was 138.4 MB in the beginning and 234.9 MB in the end (delta: 96.5 MB). Free memory was 101.8 MB in the beginning and 126.5 MB in the end (delta: -24.7 MB). Peak memory consumption was 71.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:02,329 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:28:02,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 420.10 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 180.2 MB in the end (delta: -78.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:02,333 INFO L168 Benchmark]: Boogie Preprocessor took 39.75 ms. Allocated memory is still 202.4 MB. Free memory was 180.2 MB in the beginning and 178.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:02,335 INFO L168 Benchmark]: RCFGBuilder took 393.04 ms. Allocated memory is still 202.4 MB. Free memory was 178.4 MB in the beginning and 160.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:02,336 INFO L168 Benchmark]: TraceAbstraction took 2388.46 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 159.8 MB in the beginning and 126.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 65.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:02,345 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 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 420.10 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 180.2 MB in the end (delta: -78.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.75 ms. Allocated memory is still 202.4 MB. Free memory was 180.2 MB in the beginning and 178.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 393.04 ms. Allocated memory is still 202.4 MB. Free memory was 178.4 MB in the beginning and 160.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2388.46 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 159.8 MB in the beginning and 126.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 65.8 MB. 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: 275#true or 458#(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: 275#true or 458#(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...