/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/nr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:27:48,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:27:48,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:27:48,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:27:48,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:27:48,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:27:48,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:27:48,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:27:48,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:27:48,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:27:48,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:27:48,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:27:48,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:27:48,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:27:48,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:27:48,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:27:48,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:27:48,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:27:48,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:27:48,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:27:48,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:27:48,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:27:48,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:27:48,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:27:48,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:27:48,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:27:48,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:27:48,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:27:48,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:27:48,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:27:48,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:27:48,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:27:48,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:27:48,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:27:48,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:27:48,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:27:48,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:27:48,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:27:48,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:27:48,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:27:48,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:27:48,863 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:48,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:27:48,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:27:48,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:27:48,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:27:48,880 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:27:48,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:27:48,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:27:48,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:27:48,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:27:48,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:27:48,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:27:48,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:27:48,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:27:48,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:27:48,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:27:48,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:27:48,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:27:48,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:27:48,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:27:48,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:27:48,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:27:48,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:27:48,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:27:48,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:27:48,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:27:48,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:27:48,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:27:48,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:27:48,885 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:49,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:27:49,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:27:49,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:27:49,175 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:27:49,175 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:27:49,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr5.c [2019-11-06 22:27:49,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5960d61d/8e733e9c56594f3cb0b8b66b4a479e8a/FLAG93e3fdd75 [2019-11-06 22:27:49,685 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:27:49,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr5.c [2019-11-06 22:27:49,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5960d61d/8e733e9c56594f3cb0b8b66b4a479e8a/FLAG93e3fdd75 [2019-11-06 22:27:50,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5960d61d/8e733e9c56594f3cb0b8b66b4a479e8a [2019-11-06 22:27:50,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:27:50,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:27:50,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:50,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:27:50,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:27:50,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:50" (1/1) ... [2019-11-06 22:27:50,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe26cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:50, skipping insertion in model container [2019-11-06 22:27:50,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:50" (1/1) ... [2019-11-06 22:27:50,063 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:27:50,082 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:27:50,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:50,277 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:27:50,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:50,320 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:27:50,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:50 WrapperNode [2019-11-06 22:27:50,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:50,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:27:50,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:27:50,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:27:50,408 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:50" (1/1) ... [2019-11-06 22:27:50,409 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:50" (1/1) ... [2019-11-06 22:27:50,415 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:50" (1/1) ... [2019-11-06 22:27:50,415 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:50" (1/1) ... [2019-11-06 22:27:50,422 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:50" (1/1) ... [2019-11-06 22:27:50,428 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:50" (1/1) ... [2019-11-06 22:27:50,429 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:50" (1/1) ... [2019-11-06 22:27:50,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:27:50,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:27:50,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:27:50,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:27:50,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:50" (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:50,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:27:50,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:27:50,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 22:27:50,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:27:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:27:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:27:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 22:27:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:27:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:27:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 22:27:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:27:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:27:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:27:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:27:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:27:50,756 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:27:50,757 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 22:27:50,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:50 BoogieIcfgContainer [2019-11-06 22:27:50,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:27:50,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:27:50,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:27:50,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:27:50,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:50" (1/3) ... [2019-11-06 22:27:50,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1e3ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:50, skipping insertion in model container [2019-11-06 22:27:50,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:50" (2/3) ... [2019-11-06 22:27:50,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1e3ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:50, skipping insertion in model container [2019-11-06 22:27:50,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:50" (3/3) ... [2019-11-06 22:27:50,765 INFO L109 eAbstractionObserver]: Analyzing ICFG nr5.c [2019-11-06 22:27:50,777 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:27:50,785 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:27:50,813 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:27:50,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:27:50,844 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:27:50,844 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:27:50,844 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:27:50,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:27:50,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:27:50,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:27:50,845 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:27:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-06 22:27:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:27:50,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:50,870 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:50,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-11-06 22:27:50,883 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:50,883 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514324338] [2019-11-06 22:27:50,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:51,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514324338] [2019-11-06 22:27:51,135 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:51,135 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:27:51,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063863107] [2019-11-06 22:27:51,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:27:51,142 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:27:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:27:51,159 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2019-11-06 22:27:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:51,251 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-11-06 22:27:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:27:51,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 22:27:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:51,263 INFO L225 Difference]: With dead ends: 60 [2019-11-06 22:27:51,264 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 22:27:51,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:27:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 22:27:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-06 22:27:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 22:27:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-06 22:27:51,309 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-11-06 22:27:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:51,309 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-06 22:27:51,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:27:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-06 22:27:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:27:51,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:51,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:51,312 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:51,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-11-06 22:27:51,313 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:51,313 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797925763] [2019-11-06 22:27:51,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:51,547 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797925763] [2019-11-06 22:27:51,547 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:51,547 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:27:51,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329187341] [2019-11-06 22:27:51,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:27:51,555 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:51,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:27:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:27:51,556 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-11-06 22:27:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:51,636 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-11-06 22:27:51,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:27:51,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-06 22:27:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:51,641 INFO L225 Difference]: With dead ends: 52 [2019-11-06 22:27:51,641 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 22:27:51,642 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:27:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 22:27:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-06 22:27:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 22:27:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 22:27:51,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-11-06 22:27:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:51,651 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 22:27:51,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:27:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 22:27:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 22:27:51,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:51,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:51,653 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-11-06 22:27:51,653 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:51,654 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640502080] [2019-11-06 22:27:51,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:51,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640502080] [2019-11-06 22:27:51,694 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:51,694 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:27:51,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696400656] [2019-11-06 22:27:51,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:27:51,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:51,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:27:51,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:27:51,696 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2019-11-06 22:27:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:51,726 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-11-06 22:27:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:27:51,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 22:27:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:51,727 INFO L225 Difference]: With dead ends: 56 [2019-11-06 22:27:51,728 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 22:27:51,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:27:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 22:27:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-06 22:27:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 22:27:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-06 22:27:51,736 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-11-06 22:27:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:51,736 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-06 22:27:51,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:27:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-06 22:27:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:27:51,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:51,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:51,738 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-11-06 22:27:51,738 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:51,739 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831679192] [2019-11-06 22:27:51,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:51,804 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831679192] [2019-11-06 22:27:51,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:51,804 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:27:51,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908524595] [2019-11-06 22:27:51,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:27:51,805 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:51,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:27:51,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:27:51,806 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-11-06 22:27:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:51,852 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-06 22:27:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:27:51,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-06 22:27:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:51,854 INFO L225 Difference]: With dead ends: 57 [2019-11-06 22:27:51,854 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 22:27:51,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:27:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 22:27:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-06 22:27:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 22:27:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 22:27:51,862 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-11-06 22:27:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:51,863 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 22:27:51,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:27:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 22:27:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:27:51,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:51,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:51,865 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-11-06 22:27:51,865 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:51,866 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105256272] [2019-11-06 22:27:51,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:51,913 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105256272] [2019-11-06 22:27:51,914 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850919878] [2019-11-06 22:27:51,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:27:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:51,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:27:52,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:27:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:52,026 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:27:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:52,054 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1733459845] [2019-11-06 22:27:52,060 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-11-06 22:27:52,100 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:27:52,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:27:52,175 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:27:52,176 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 23 root evaluator evaluations with a maximum evaluation depth of 2. Performed 23 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 26 variables. [2019-11-06 22:27:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:52,181 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:27:52,218 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 96.67% of their original sizes. [2019-11-06 22:27:52,219 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:27:52,224 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-11-06 22:27:52,224 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:27:52,225 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:27:52,225 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4] total 7 [2019-11-06 22:27:52,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920413399] [2019-11-06 22:27:52,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:27:52,226 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:27:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:27:52,227 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-11-06 22:27:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:27:52,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:27:52,432 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 529#true or 697#(and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) ([#1{~CELLCOUNT~0 = [-2147483648;2147483647]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-06 22:27:52,439 INFO L168 Benchmark]: Toolchain (without parser) took 2392.64 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.7 MB in the beginning and 188.3 MB in the end (delta: -86.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:52,440 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 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:27:52,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.22 ms. Allocated memory is still 138.4 MB. Free memory was 101.5 MB in the beginning and 91.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:52,442 INFO L168 Benchmark]: Boogie Preprocessor took 110.08 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 179.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:52,443 INFO L168 Benchmark]: RCFGBuilder took 326.51 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 163.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:52,444 INFO L168 Benchmark]: TraceAbstraction took 1677.35 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 162.8 MB in the beginning and 188.3 MB in the end (delta: -25.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:27:52,448 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.22 ms. Allocated memory is still 138.4 MB. Free memory was 101.5 MB in the beginning and 91.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.08 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 179.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 326.51 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 163.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1677.35 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 162.8 MB in the beginning and 188.3 MB in the end (delta: -25.4 MB). Peak memory consumption was 7.6 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: 529#true or 697#(and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) ([#1{~CELLCOUNT~0 = [-2147483648;2147483647]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 529#true or 697#(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...