/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/rewrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:28:03,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:28:03,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:28:03,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:28:03,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:28:03,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:28:03,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:28:03,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:28:03,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:28:03,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:28:03,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:28:03,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:28:03,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:28:03,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:28:03,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:28:03,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:28:03,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:28:03,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:28:03,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:28:03,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:28:03,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:28:03,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:28:03,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:28:03,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:28:03,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:28:03,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:28:03,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:28:03,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:28:03,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:28:03,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:28:03,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:28:03,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:28:03,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:28:03,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:28:03,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:28:03,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:28:03,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:28:03,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:28:03,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:28:03,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:28:03,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:28:03,921 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:28:03,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:28:03,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:28:03,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:28:03,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:28:03,963 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:28:03,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:28:03,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:28:03,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:28:03,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:28:03,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:28:03,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:28:03,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:28:03,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:28:03,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:28:03,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:28:03,965 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:28:03,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:28:03,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:28:03,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:28:03,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:28:03,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:28:03,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:28:03,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:28:03,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:28:03,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:28:03,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:28:03,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:28:03,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:28:03,969 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:28:04,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:28:04,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:28:04,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:28:04,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:28:04,251 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:28:04,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewrev.c [2019-11-06 22:28:04,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579f388cf/0784ab9b69304ec6af8066e4870c897f/FLAG2b0389316 [2019-11-06 22:28:04,774 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:28:04,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewrev.c [2019-11-06 22:28:04,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579f388cf/0784ab9b69304ec6af8066e4870c897f/FLAG2b0389316 [2019-11-06 22:28:05,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579f388cf/0784ab9b69304ec6af8066e4870c897f [2019-11-06 22:28:05,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:28:05,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:28:05,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:28:05,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:28:05,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:28:05,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:05" (1/1) ... [2019-11-06 22:28:05,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10bb15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:05, skipping insertion in model container [2019-11-06 22:28:05,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:05" (1/1) ... [2019-11-06 22:28:05,156 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:28:05,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:28:05,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:28:05,342 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:28:05,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:28:05,379 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:28:05,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:05 WrapperNode [2019-11-06 22:28:05,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:28:05,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:28:05,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:28:05,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:28:05,474 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:05" (1/1) ... [2019-11-06 22:28:05,474 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:05" (1/1) ... [2019-11-06 22:28:05,483 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:05" (1/1) ... [2019-11-06 22:28:05,484 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:05" (1/1) ... [2019-11-06 22:28:05,496 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:05" (1/1) ... [2019-11-06 22:28:05,506 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:05" (1/1) ... [2019-11-06 22:28:05,507 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:05" (1/1) ... [2019-11-06 22:28:05,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:28:05,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:28:05,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:28:05,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:28:05,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:05" (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:05,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:28:05,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:28:05,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 22:28:05,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:28:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:28:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:28:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 22:28:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:28:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:28:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:28:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:28:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:28:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:28:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:28:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:28:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:28:05,834 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:28:05,835 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 22:28:05,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:05 BoogieIcfgContainer [2019-11-06 22:28:05,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:28:05,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:28:05,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:28:05,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:28:05,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:05" (1/3) ... [2019-11-06 22:28:05,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd8038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:05, skipping insertion in model container [2019-11-06 22:28:05,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:05" (2/3) ... [2019-11-06 22:28:05,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd8038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:05, skipping insertion in model container [2019-11-06 22:28:05,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:05" (3/3) ... [2019-11-06 22:28:05,846 INFO L109 eAbstractionObserver]: Analyzing ICFG rewrev.c [2019-11-06 22:28:05,854 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:28:05,860 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:28:05,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:28:05,906 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:28:05,906 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:28:05,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:28:05,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:28:05,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:28:05,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:28:05,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:28:05,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:28:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-06 22:28:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:28:05,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:05,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:28:05,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-11-06 22:28:05,946 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:05,946 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808925827] [2019-11-06 22:28:05,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:06,087 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:06,087 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808925827] [2019-11-06 22:28:06,088 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:06,088 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:28:06,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3585288] [2019-11-06 22:28:06,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:28:06,095 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:28:06,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:28:06,113 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-11-06 22:28:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:06,138 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-06 22:28:06,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:28:06,140 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-06 22:28:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:06,149 INFO L225 Difference]: With dead ends: 43 [2019-11-06 22:28:06,149 INFO L226 Difference]: Without dead ends: 22 [2019-11-06 22:28:06,152 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:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-06 22:28:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-06 22:28:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-06 22:28:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-06 22:28:06,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-11-06 22:28:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:06,193 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-06 22:28:06,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:28:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-06 22:28:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:28:06,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:06,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:28:06,195 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-11-06 22:28:06,195 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:06,196 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967282696] [2019-11-06 22:28:06,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:06,282 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:06,283 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967282696] [2019-11-06 22:28:06,284 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:06,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:28:06,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714908823] [2019-11-06 22:28:06,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:28:06,287 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:28:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:28:06,289 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-11-06 22:28:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:06,388 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-11-06 22:28:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:28:06,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-06 22:28:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:06,391 INFO L225 Difference]: With dead ends: 41 [2019-11-06 22:28:06,392 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 22:28:06,394 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:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 22:28:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-06 22:28:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-06 22:28:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-06 22:28:06,404 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-11-06 22:28:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:06,404 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-06 22:28:06,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:28:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-06 22:28:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 22:28:06,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:06,406 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:06,406 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-11-06 22:28:06,407 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:06,407 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743002828] [2019-11-06 22:28:06,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:06,492 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:06,497 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743002828] [2019-11-06 22:28:06,497 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:28:06,498 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:28:06,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916831854] [2019-11-06 22:28:06,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:28:06,500 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:06,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:28:06,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:28:06,501 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-11-06 22:28:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:28:06,550 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-06 22:28:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:28:06,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-06 22:28:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:28:06,552 INFO L225 Difference]: With dead ends: 38 [2019-11-06 22:28:06,552 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 22:28:06,553 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:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 22:28:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-06 22:28:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 22:28:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-06 22:28:06,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-11-06 22:28:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:28:06,560 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-06 22:28:06,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:28:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-06 22:28:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:28:06,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:28:06,562 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:06,562 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:28:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-11-06 22:28:06,563 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:28:06,563 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225680712] [2019-11-06 22:28:06,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:28:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:07,096 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:07,097 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225680712] [2019-11-06 22:28:07,097 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508639946] [2019-11-06 22:28:07,097 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:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:28:07,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 22:28:07,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:28:07,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 22:28:07,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:07,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:07,334 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:07,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-06 22:28:07,459 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:07,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-06 22:28:07,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:07,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 22:28:07,487 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-06 22:28:07,489 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:07,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2019-11-06 22:28:07,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 22:28:07,569 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:28:07,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-11-06 22:28:07,677 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 32 treesize of output 30 [2019-11-06 22:28:07,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 22:28:07,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:07,682 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-06 22:28:07,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:28:07,688 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 2 xjuncts. [2019-11-06 22:28:07,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:14 [2019-11-06 22:28:07,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:07,789 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:07,789 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [164789766] [2019-11-06 22:28:07,796 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-11-06 22:28:07,831 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:28:07,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:28:07,904 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:28:07,905 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 27 variables. [2019-11-06 22:28:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:07,910 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:28:07,947 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-11-06 22:28:07,947 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:28:07,955 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-11-06 22:28:07,955 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:28:07,956 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:28:07,956 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12, 10, 10] total 28 [2019-11-06 22:28:07,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891053499] [2019-11-06 22:28:07,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:28:07,957 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:28:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-11-06 22:28:07,959 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-11-06 22:28:07,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:28:08,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:28:08,164 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#(= ~MAX~0 100000) ([#1{~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:08,170 INFO L168 Benchmark]: Toolchain (without parser) took 3030.46 ms. Allocated memory was 140.0 MB in the beginning and 235.4 MB in the end (delta: 95.4 MB). Free memory was 103.5 MB in the beginning and 124.2 MB in the end (delta: -20.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:08,172 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-06 22:28:08,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.20 ms. Allocated memory is still 140.0 MB. Free memory was 103.3 MB in the beginning and 93.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:08,181 INFO L168 Benchmark]: Boogie Preprocessor took 128.67 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.2 MB in the beginning and 182.8 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:08,181 INFO L168 Benchmark]: RCFGBuilder took 326.88 ms. Allocated memory is still 204.5 MB. Free memory was 182.8 MB in the beginning and 168.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:08,183 INFO L168 Benchmark]: TraceAbstraction took 2331.40 ms. Allocated memory was 204.5 MB in the beginning and 235.4 MB in the end (delta: 30.9 MB). Free memory was 167.4 MB in the beginning and 124.2 MB in the end (delta: 43.2 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:08,196 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.19 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 239.20 ms. Allocated memory is still 140.0 MB. Free memory was 103.3 MB in the beginning and 93.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.67 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.2 MB in the beginning and 182.8 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 326.88 ms. Allocated memory is still 204.5 MB. Free memory was 182.8 MB in the beginning and 168.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2331.40 ms. Allocated memory was 204.5 MB in the beginning and 235.4 MB in the end (delta: 30.9 MB). Free memory was 167.4 MB in the beginning and 124.2 MB in the end (delta: 43.2 MB). Peak memory consumption was 74.1 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#(= ~MAX~0 100000) ([#1{~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#(= ~MAX~0 100000) ([#1{~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...