/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/rewnif.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:27:59,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:27:59,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:27:59,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:27:59,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:27:59,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:27:59,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:27:59,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:27:59,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:27:59,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:27:59,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:27:59,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:27:59,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:27:59,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:27:59,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:27:59,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:27:59,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:27:59,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:27:59,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:27:59,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:27:59,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:27:59,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:27:59,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:27:59,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:27:59,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:27:59,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:27:59,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:27:59,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:27:59,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:27:59,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:27:59,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:27:59,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:27:59,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:27:59,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:27:59,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:27:59,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:27:59,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:27:59,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:27:59,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:27:59,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:27:59,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:27:59,600 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:59,634 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:27:59,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:27:59,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:27:59,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:27:59,641 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:27:59,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:27:59,642 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:27:59,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:27:59,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:27:59,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:27:59,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:27:59,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:27:59,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:27:59,643 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:27:59,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:27:59,644 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:27:59,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:27:59,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:27:59,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:27:59,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:27:59,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:27:59,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:27:59,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:27:59,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:27:59,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:27:59,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:27:59,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:27:59,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:27:59,646 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:59,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:27:59,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:27:59,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:27:59,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:27:59,963 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:27:59,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnif.c [2019-11-06 22:28:00,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9a848ed/efb4a76d88744a628a20e1f999f89f80/FLAGfe9aadd2b [2019-11-06 22:28:00,546 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:28:00,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnif.c [2019-11-06 22:28:00,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9a848ed/efb4a76d88744a628a20e1f999f89f80/FLAGfe9aadd2b [2019-11-06 22:28:00,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9a848ed/efb4a76d88744a628a20e1f999f89f80 [2019-11-06 22:28:00,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:28:00,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:28:00,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:28:00,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:28:00,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:28:00,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:00" (1/1) ... [2019-11-06 22:28:00,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e97d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00, skipping insertion in model container [2019-11-06 22:28:00,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:00" (1/1) ... [2019-11-06 22:28:00,973 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:28:00,995 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:28:01,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:28:01,213 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:28:01,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:28:01,245 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:28:01,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01 WrapperNode [2019-11-06 22:28:01,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:28:01,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:28:01,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:28:01,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:28:01,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (1/1) ... [2019-11-06 22:28:01,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (1/1) ... [2019-11-06 22:28:01,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (1/1) ... [2019-11-06 22:28:01,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (1/1) ... [2019-11-06 22:28:01,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (1/1) ... [2019-11-06 22:28:01,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (1/1) ... [2019-11-06 22:28:01,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (1/1) ... [2019-11-06 22:28:01,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:28:01,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:28:01,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:28:01,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:28:01,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (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:28:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:28:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:28:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 22:28:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:28:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:28:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:28:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 22:28:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:28:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:28:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:28:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:28:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:28:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:28:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:28:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:28:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:28:01,670 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:28:01,670 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 22:28:01,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:01 BoogieIcfgContainer [2019-11-06 22:28:01,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:28:01,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:28:01,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:28:01,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:28:01,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:00" (1/3) ... [2019-11-06 22:28:01,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9dc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:01, skipping insertion in model container [2019-11-06 22:28:01,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:01" (2/3) ... [2019-11-06 22:28:01,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9dc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:01, skipping insertion in model container [2019-11-06 22:28:01,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:01" (3/3) ... [2019-11-06 22:28:01,680 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnif.c [2019-11-06 22:28:01,692 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:28:01,701 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:28:01,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:28:01,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:28:01,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:28:01,740 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:28:01,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:28:01,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:28:01,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:28:01,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:28:01,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:28:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-06 22:28:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:28:01,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:01,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:28:01,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-11-06 22:28:01,781 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:01,782 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600618615] [2019-11-06 22:28:01,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:01,918 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:01,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600618615] [2019-11-06 22:28:01,919 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:01,919 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:28:01,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581774747] [2019-11-06 22:28:01,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:28:01,926 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:28:01,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:28:01,940 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-11-06 22:28:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:01,959 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-06 22:28:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:28:01,960 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-06 22:28:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:01,966 INFO L225 Difference]: With dead ends: 43 [2019-11-06 22:28:01,966 INFO L226 Difference]: Without dead ends: 22 [2019-11-06 22:28:01,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:28:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-06 22:28:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-06 22:28:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-06 22:28:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-06 22:28:02,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-11-06 22:28:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:02,004 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-06 22:28:02,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:28:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-06 22:28:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:28:02,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:02,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:28:02,006 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-11-06 22:28:02,007 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:02,007 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989386339] [2019-11-06 22:28:02,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:02,096 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:02,099 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989386339] [2019-11-06 22:28:02,099 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:02,100 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:28:02,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218408891] [2019-11-06 22:28:02,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:28:02,102 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:28:02,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:28:02,103 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-11-06 22:28:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:02,217 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-11-06 22:28:02,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:28:02,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-06 22:28:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:02,219 INFO L225 Difference]: With dead ends: 41 [2019-11-06 22:28:02,219 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 22:28:02,221 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:28:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 22:28:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-06 22:28:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-06 22:28:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-06 22:28:02,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-11-06 22:28:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:02,233 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-06 22:28:02,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:28:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-06 22:28:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 22:28:02,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:02,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:28:02,235 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-11-06 22:28:02,237 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:02,237 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066403550] [2019-11-06 22:28:02,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:02,330 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:28:02,331 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066403550] [2019-11-06 22:28:02,331 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:02,331 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:28:02,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341008044] [2019-11-06 22:28:02,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:28:02,333 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:02,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:28:02,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:28:02,335 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-11-06 22:28:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:02,408 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-06 22:28:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:28:02,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-06 22:28:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:02,410 INFO L225 Difference]: With dead ends: 38 [2019-11-06 22:28:02,410 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 22:28:02,411 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:28:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 22:28:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-06 22:28:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 22:28:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-06 22:28:02,418 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-11-06 22:28:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:02,418 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-06 22:28:02,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:28:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-06 22:28:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:28:02,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:02,420 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:28:02,420 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-11-06 22:28:02,421 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:02,421 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754445688] [2019-11-06 22:28:02,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:28:02,751 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754445688] [2019-11-06 22:28:02,751 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803816172] [2019-11-06 22:28:02,752 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:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:02,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 22:28:02,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:28:02,927 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 15 treesize of output 11 [2019-11-06 22:28:02,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:02,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:02,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:02,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-06 22:28:03,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:03,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 [2019-11-06 22:28:03,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:03,036 INFO L567 ElimStorePlain]: treesize reduction 24, result has 47.8 percent of original size [2019-11-06 22:28:03,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:28:03,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-11-06 22:28:03,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:03,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2019-11-06 22:28:03,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:03,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:03,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:03,190 INFO L567 ElimStorePlain]: treesize reduction 51, result has 16.4 percent of original size [2019-11-06 22:28:03,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:03,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:7 [2019-11-06 22:28:03,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:28:03,246 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:28:03,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-11-06 22:28:03,399 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 30 treesize of output 28 [2019-11-06 22:28:03,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 22:28:03,405 INFO L567 ElimStorePlain]: treesize reduction 6, result has 53.8 percent of original size [2019-11-06 22:28:03,406 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:03,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:03,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:28:03,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:7 [2019-11-06 22:28:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 22:28:03,431 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2073383287] [2019-11-06 22:28:03,441 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-11-06 22:28:03,486 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:28:03,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:28:03,581 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:28:03,583 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2019-11-06 22:28:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:03,589 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:28:03,632 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-11-06 22:28:03,632 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:28:03,641 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-11-06 22:28:03,642 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:28:03,642 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:28:03,642 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 10, 9] total 23 [2019-11-06 22:28:03,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908089815] [2019-11-06 22:28:03,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:28:03,644 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:28:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:28:03,645 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-11-06 22:28:03,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:28:03,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:28:03,856 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: 298#true or 482#(and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) ([#1{~SIZE~0 = [-2147483648;2147483647]; ~MAX~0 = [100000;100000]; }]) 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:03,861 INFO L168 Benchmark]: Toolchain (without parser) took 2906.85 ms. Allocated memory was 140.0 MB in the beginning and 232.8 MB in the end (delta: 92.8 MB). Free memory was 104.4 MB in the beginning and 135.4 MB in the end (delta: -31.0 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:03,862 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:28:03,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.72 ms. Allocated memory is still 140.0 MB. Free memory was 104.2 MB in the beginning and 94.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:03,863 INFO L168 Benchmark]: Boogie Preprocessor took 123.48 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.3 MB in the beginning and 181.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:03,864 INFO L168 Benchmark]: RCFGBuilder took 302.74 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 166.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:03,865 INFO L168 Benchmark]: TraceAbstraction took 2185.47 ms. Allocated memory was 203.4 MB in the beginning and 232.8 MB in the end (delta: 29.4 MB). Free memory was 166.1 MB in the beginning and 135.4 MB in the end (delta: 30.7 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:03,869 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.72 ms. Allocated memory is still 140.0 MB. Free memory was 104.2 MB in the beginning and 94.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.48 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.3 MB in the beginning and 181.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 302.74 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 166.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2185.47 ms. Allocated memory was 203.4 MB in the beginning and 232.8 MB in the end (delta: 29.4 MB). Free memory was 166.1 MB in the beginning and 135.4 MB in the end (delta: 30.7 MB). Peak memory consumption was 60.0 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: 298#true or 482#(and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) ([#1{~SIZE~0 = [-2147483648;2147483647]; ~MAX~0 = [100000;100000]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 298#true or 482#(and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) ([#1{~SIZE~0 = [-2147483648;2147483647]; ~MAX~0 = [100000;100000]; }]): 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...