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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-regression/test27-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 12:48:59,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 12:48:59,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 12:48:59,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 12:48:59,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 12:48:59,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 12:48:59,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 12:48:59,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 12:48:59,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 12:48:59,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 12:48:59,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 12:48:59,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 12:48:59,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 12:48:59,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 12:48:59,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 12:48:59,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 12:48:59,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 12:48:59,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 12:48:59,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 12:48:59,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 12:48:59,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 12:48:59,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 12:48:59,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 12:48:59,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 12:48:59,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 12:48:59,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 12:48:59,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 12:48:59,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 12:48:59,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 12:48:59,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 12:48:59,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 12:48:59,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 12:48:59,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 12:48:59,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 12:48:59,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 12:48:59,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 12:48:59,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 12:48:59,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 12:48:59,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 12:48:59,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 12:48:59,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 12:48:59,203 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-10-07 12:48:59,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 12:48:59,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 12:48:59,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 12:48:59,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 12:48:59,246 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 12:48:59,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 12:48:59,247 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 12:48:59,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 12:48:59,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 12:48:59,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 12:48:59,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 12:48:59,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 12:48:59,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 12:48:59,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 12:48:59,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 12:48:59,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 12:48:59,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 12:48:59,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 12:48:59,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 12:48:59,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 12:48:59,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 12:48:59,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 12:48:59,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 12:48:59,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 12:48:59,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 12:48:59,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 12:48:59,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 12:48:59,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 12:48:59,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 12:48:59,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 12:48:59,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 12:48:59,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 12:48:59,616 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 12:48:59,617 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 12:48:59,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test27-1.c [2019-10-07 12:48:59,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d09201a/a605193f0cd3486eb16f2323bf394ada/FLAGdc5a97159 [2019-10-07 12:49:00,235 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 12:49:00,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test27-1.c [2019-10-07 12:49:00,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d09201a/a605193f0cd3486eb16f2323bf394ada/FLAGdc5a97159 [2019-10-07 12:49:00,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d09201a/a605193f0cd3486eb16f2323bf394ada [2019-10-07 12:49:00,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 12:49:00,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 12:49:00,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 12:49:00,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 12:49:00,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 12:49:00,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:49:00" (1/1) ... [2019-10-07 12:49:00,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f30a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:00, skipping insertion in model container [2019-10-07 12:49:00,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:49:00" (1/1) ... [2019-10-07 12:49:00,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 12:49:00,618 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 12:49:00,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:49:00,937 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 12:49:00,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:49:01,113 INFO L192 MainTranslator]: Completed translation [2019-10-07 12:49:01,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01 WrapperNode [2019-10-07 12:49:01,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 12:49:01,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 12:49:01,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 12:49:01,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 12:49:01,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... [2019-10-07 12:49:01,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... [2019-10-07 12:49:01,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... [2019-10-07 12:49:01,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... [2019-10-07 12:49:01,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... [2019-10-07 12:49:01,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... [2019-10-07 12:49:01,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... [2019-10-07 12:49:01,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 12:49:01,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 12:49:01,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 12:49:01,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 12:49:01,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 12:49:01,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 12:49:01,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 12:49:01,229 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 12:49:01,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 12:49:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 12:49:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 12:49:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 12:49:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 12:49:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 12:49:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 12:49:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 12:49:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 12:49:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 12:49:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 12:49:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 12:49:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 12:49:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 12:49:01,685 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 12:49:01,685 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 12:49:01,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:49:01 BoogieIcfgContainer [2019-10-07 12:49:01,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 12:49:01,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 12:49:01,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 12:49:01,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 12:49:01,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:49:00" (1/3) ... [2019-10-07 12:49:01,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e54497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:49:01, skipping insertion in model container [2019-10-07 12:49:01,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:49:01" (2/3) ... [2019-10-07 12:49:01,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e54497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:49:01, skipping insertion in model container [2019-10-07 12:49:01,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:49:01" (3/3) ... [2019-10-07 12:49:01,694 INFO L109 eAbstractionObserver]: Analyzing ICFG test27-1.c [2019-10-07 12:49:01,704 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 12:49:01,712 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 12:49:01,723 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 12:49:01,748 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 12:49:01,748 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 12:49:01,748 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 12:49:01,748 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 12:49:01,748 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 12:49:01,749 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 12:49:01,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 12:49:01,749 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 12:49:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-07 12:49:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 12:49:01,774 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:49:01,776 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:49:01,778 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:49:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:49:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1941687829, now seen corresponding path program 1 times [2019-10-07 12:49:01,793 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:49:01,793 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:01,793 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:01,794 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:49:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:02,004 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:02,006 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:49:02,007 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 12:49:02,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 12:49:02,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 12:49:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 12:49:02,028 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-10-07 12:49:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:49:02,059 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-10-07 12:49:02,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 12:49:02,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-07 12:49:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:49:02,070 INFO L225 Difference]: With dead ends: 34 [2019-10-07 12:49:02,071 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 12:49:02,075 INFO L606 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-10-07 12:49:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 12:49:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 12:49:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 12:49:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-07 12:49:02,120 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-10-07 12:49:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:49:02,120 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-07 12:49:02,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 12:49:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-07 12:49:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 12:49:02,122 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:49:02,122 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:49:02,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:49:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:49:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -399303129, now seen corresponding path program 1 times [2019-10-07 12:49:02,123 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:49:02,124 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:02,124 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:02,124 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:49:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:02,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:02,225 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:49:02,225 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 12:49:02,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 12:49:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 12:49:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 12:49:02,228 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2019-10-07 12:49:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:49:02,246 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-10-07 12:49:02,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 12:49:02,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-07 12:49:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:49:02,249 INFO L225 Difference]: With dead ends: 29 [2019-10-07 12:49:02,249 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 12:49:02,250 INFO L606 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-10-07 12:49:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 12:49:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 12:49:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 12:49:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-07 12:49:02,257 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2019-10-07 12:49:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:49:02,257 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-07 12:49:02,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 12:49:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-07 12:49:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 12:49:02,259 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:49:02,259 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:49:02,259 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:49:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:49:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -194170152, now seen corresponding path program 1 times [2019-10-07 12:49:02,260 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:49:02,260 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:02,261 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:02,261 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:49:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:02,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:02,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:49:02,376 INFO L95 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-10-07 12:49:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:02,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 12:49:02,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:49:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:02,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:49:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:02,568 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 12:49:02,600 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-07 12:49:02,600 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 12:49:02,608 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 12:49:02,619 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 12:49:02,620 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 12:49:02,864 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 12:49:03,875 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-10-07 12:49:04,110 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-07 12:49:04,316 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-07 12:49:04,353 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:04,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:04,790 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:04,974 INFO L199 IcfgInterpreter]: Interpreting procedure check with input of size 35 for LOIs [2019-10-07 12:49:04,979 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 12:49:04,991 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 12:49:04,991 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 12:49:04,992 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 337#(exists ((v_main_~i~0_14 Int)) (or (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (<= 0 |main_#t~ret17|) (= |main_#t~ret17| 1) (<= 10 main_~j~0) (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4))) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9) (<= |main_#t~ret17| 1)) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= |main_#t~ret17| 0) (<= 0 |main_#t~ret17|) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 10 main_~j~0) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9) (<= |main_#t~ret17| 1)))) [2019-10-07 12:49:04,992 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 374#(exists ((v_main_~i~0_14 Int)) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 10 main_~j~0) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9))) [2019-10-07 12:49:04,993 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 393#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 12:49:04,993 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 364#(exists ((v_main_~i~0_14 Int)) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 10 main_~j~0) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9))) [2019-10-07 12:49:04,994 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 73#(and (<= 10 main_~j~0) (not (< main_~j~0 10))) [2019-10-07 12:49:04,994 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 68#true [2019-10-07 12:49:04,994 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 320#(exists ((v_main_~i~0_14 Int)) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (<= 10 main_~j~0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= 0 v_main_~i~0_14) (<= v_main_~i~0_14 9))) [2019-10-07 12:49:04,995 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 310#(exists ((v_main_~i~0_14 Int)) (and (<= 10 main_~j~0) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9))) [2019-10-07 12:49:04,995 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:49:04,995 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 12:49:04,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 398#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:49:04,996 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 190#(and (<= 0 main_~i~0) (<= main_~i~0 9) (<= 10 main_~j~0)) [2019-10-07 12:49:04,996 INFO L193 IcfgInterpreter]: Reachable states at location checkEXIT satisfy 389#(and (= check_~pc.base |check_#in~pc.base|) (<= |check_#res| 1) (= |check_#in~i| check_~i) (= |check_#res| (ite (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) 4)) check_~i) 1 0)) (= check_~pc.offset |check_#in~pc.offset|) (exists ((v_main_~pa~0.offset_BEFORE_CALL_3 Int) (|v_main_~#dummies~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_14 Int) (|v_main_~#dummies~0.base_BEFORE_CALL_3| Int) (v_main_~pa~0.base_BEFORE_CALL_3 Int)) (and (<= 0 v_main_~i~0_14) (<= (select (select |#memory_int| v_main_~pa~0.base_BEFORE_CALL_3) v_main_~pa~0.offset_BEFORE_CALL_3) |check_#in~i|) (= (+ |check_#in~i| 10) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4))) 4))) (<= v_main_~i~0_14 9))) (<= 0 |check_#res|)) [2019-10-07 12:49:04,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 12:49:04,997 INFO L193 IcfgInterpreter]: Reachable states at location L40-1 satisfy 315#(and (= |main_#t~mem15| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_14 Int)) (and (<= 10 main_~j~0) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9)))) [2019-10-07 12:49:04,997 INFO L193 IcfgInterpreter]: Reachable states at location checkENTRY satisfy 384#(exists ((v_main_~pa~0.offset_BEFORE_CALL_3 Int) (|v_main_~#dummies~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_14 Int) (|v_main_~#dummies~0.base_BEFORE_CALL_3| Int) (v_main_~pa~0.base_BEFORE_CALL_3 Int)) (and (<= 0 v_main_~i~0_14) (<= (select (select |#memory_int| v_main_~pa~0.base_BEFORE_CALL_3) v_main_~pa~0.offset_BEFORE_CALL_3) |check_#in~i|) (= (+ |check_#in~i| 10) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |v_main_~#dummies~0.base_BEFORE_CALL_3|) (+ |v_main_~#dummies~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_14) 4))) 4))) (<= v_main_~i~0_14 9))) [2019-10-07 12:49:04,998 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 379#(and (exists ((v_main_~i~0_14 Int)) (or (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (<= 0 |main_#t~ret17|) (= |main_#t~ret17| 1) (<= 10 main_~j~0) (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4))) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9) (<= |main_#t~ret17| 1)) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= |main_#t~ret17| 0) (<= 0 |main_#t~ret17|) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 10 main_~j~0) (<= 0 v_main_~i~0_14) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (+ |main_~#dummies~0.offset| (* 4 v_main_~i~0_14) 4))) 4)) (+ main_~i~0 10)) (<= v_main_~i~0_14 9) (<= |main_#t~ret17| 1)))) (<= |main_#t~ret17| 2147483647) (<= 0 (+ |main_#t~ret17| 2147483648))) [2019-10-07 12:49:05,714 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 12:49:05,714 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 14] total 20 [2019-10-07 12:49:05,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-07 12:49:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-07 12:49:05,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-10-07 12:49:05,720 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 20 states. [2019-10-07 12:49:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:49:06,916 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-10-07 12:49:06,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 12:49:06,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2019-10-07 12:49:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:49:06,918 INFO L225 Difference]: With dead ends: 41 [2019-10-07 12:49:06,919 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 12:49:06,920 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 12:49:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 12:49:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-10-07 12:49:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 12:49:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-07 12:49:06,927 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2019-10-07 12:49:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:49:06,927 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-07 12:49:06,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-07 12:49:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-07 12:49:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 12:49:06,928 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:49:06,928 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:49:07,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:07,133 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:49:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:49:07,134 INFO L82 PathProgramCache]: Analyzing trace with hash 812335719, now seen corresponding path program 2 times [2019-10-07 12:49:07,134 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:49:07,134 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:07,135 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:07,135 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:49:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:07,266 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:07,266 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:49:07,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:07,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-07 12:49:07,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 12:49:07,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-07 12:49:07,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:49:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 12:49:07,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:49:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 12:49:07,880 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 12:49:07,880 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [7] total 14 [2019-10-07 12:49:07,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 12:49:07,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 12:49:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-07 12:49:07,883 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2019-10-07 12:49:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:49:08,155 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-07 12:49:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 12:49:08,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-07 12:49:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:49:08,158 INFO L225 Difference]: With dead ends: 32 [2019-10-07 12:49:08,158 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 12:49:08,159 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-07 12:49:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 12:49:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 12:49:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 12:49:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-07 12:49:08,166 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2019-10-07 12:49:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:49:08,167 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-07 12:49:08,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 12:49:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-07 12:49:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 12:49:08,168 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:49:08,168 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:49:08,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:08,373 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:49:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:49:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1966441679, now seen corresponding path program 1 times [2019-10-07 12:49:08,374 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:49:08,375 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:08,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:08,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:49:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 12:49:08,455 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:08,455 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:49:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:08,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 12:49:08,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:49:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 12:49:08,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:49:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 12:49:08,636 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 12:49:08,639 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-07 12:49:08,639 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 12:49:08,640 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 12:49:08,640 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 12:49:08,640 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 12:49:08,667 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 12:49:09,590 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-07 12:49:09,758 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-07 12:49:09,775 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:09,848 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:09,949 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:10,147 INFO L199 IcfgInterpreter]: Interpreting procedure check with input of size 8 for LOIs [2019-10-07 12:49:10,153 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 12:49:10,157 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 12:49:10,157 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 12:49:10,157 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 370#(and (or (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (<= 0 |main_#t~ret17|) (= |main_#t~ret17| 1) (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= |main_#t~ret17| 0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 0 |main_#t~ret17|))) (<= |main_#t~ret17| 1)) [2019-10-07 12:49:10,158 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 407#(and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4))))) [2019-10-07 12:49:10,159 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 426#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 12:49:10,159 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 397#(and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4))))) [2019-10-07 12:49:10,159 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 73#(and (<= 10 main_~j~0) (not (< main_~j~0 10))) [2019-10-07 12:49:10,159 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 68#true [2019-10-07 12:49:10,160 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 353#(<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) [2019-10-07 12:49:10,160 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 343#true [2019-10-07 12:49:10,160 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:49:10,160 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 12:49:10,160 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 190#(and (<= 0 main_~i~0) (<= main_~i~0 9) (<= 10 main_~j~0)) [2019-10-07 12:49:10,161 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 431#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:49:10,161 INFO L193 IcfgInterpreter]: Reachable states at location checkEXIT satisfy 422#(and (= check_~pc.base |check_#in~pc.base|) (<= |check_#res| 1) (= |check_#in~i| check_~i) (= |check_#res| (ite (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) 4)) check_~i) 1 0)) (= check_~pc.offset |check_#in~pc.offset|) (exists ((v_main_~pa~0.offset_BEFORE_CALL_6 Int) (v_main_~pa~0.base_BEFORE_CALL_6 Int)) (<= (select (select |#memory_int| v_main_~pa~0.base_BEFORE_CALL_6) v_main_~pa~0.offset_BEFORE_CALL_6) |check_#in~i|)) (<= 0 |check_#res|)) [2019-10-07 12:49:10,161 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 12:49:10,161 INFO L193 IcfgInterpreter]: Reachable states at location L40-1 satisfy 348#(= |main_#t~mem15| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) [2019-10-07 12:49:10,161 INFO L193 IcfgInterpreter]: Reachable states at location checkENTRY satisfy 417#(exists ((v_main_~pa~0.offset_BEFORE_CALL_6 Int) (v_main_~pa~0.base_BEFORE_CALL_6 Int)) (<= (select (select |#memory_int| v_main_~pa~0.base_BEFORE_CALL_6) v_main_~pa~0.offset_BEFORE_CALL_6) |check_#in~i|)) [2019-10-07 12:49:10,162 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 412#(and (or (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (<= |main_#t~ret17| 2147483647) (<= 0 |main_#t~ret17|) (<= 0 (+ |main_#t~ret17| 2147483648)) (= |main_#t~ret17| 1) (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= |main_#t~ret17| 0) (<= |main_#t~ret17| 2147483647) (<= 0 |main_#t~ret17|) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 0 (+ |main_#t~ret17| 2147483648)))) (<= |main_#t~ret17| 1)) [2019-10-07 12:49:12,644 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 12:49:12,645 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-07 12:49:12,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 12:49:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 12:49:12,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-10-07 12:49:12,647 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 25 states. [2019-10-07 12:49:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:49:13,598 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-07 12:49:13,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 12:49:13,598 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-10-07 12:49:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:49:13,599 INFO L225 Difference]: With dead ends: 46 [2019-10-07 12:49:13,599 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 12:49:13,601 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=302, Invalid=1590, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 12:49:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 12:49:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-07 12:49:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 12:49:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-10-07 12:49:13,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2019-10-07 12:49:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:49:13,610 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-10-07 12:49:13,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 12:49:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-10-07 12:49:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 12:49:13,611 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:49:13,611 INFO L385 BasicCegarLoop]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:49:13,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:13,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:49:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:49:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash 372032913, now seen corresponding path program 2 times [2019-10-07 12:49:13,817 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:49:13,817 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:13,817 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:13,818 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:13,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:49:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:15,383 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 27 [2019-10-07 12:49:15,563 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 27 [2019-10-07 12:49:15,916 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 40 [2019-10-07 12:49:16,346 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 43 [2019-10-07 12:49:16,732 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 44 [2019-10-07 12:49:17,013 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 26 [2019-10-07 12:49:17,203 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 26 [2019-10-07 12:49:17,427 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 26 [2019-10-07 12:49:17,635 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 29 [2019-10-07 12:49:17,796 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 23 [2019-10-07 12:49:18,825 WARN L191 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 73 [2019-10-07 12:49:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:19,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:19,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:49:19,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:19,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 12:49:19,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 12:49:19,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-07 12:49:19,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:49:19,797 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-07 12:49:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 12:49:20,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:49:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 12:49:20,744 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 12:49:20,746 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-07 12:49:20,746 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 12:49:20,747 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 12:49:20,747 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 12:49:20,747 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 12:49:20,783 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 12:49:21,664 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-07 12:49:21,815 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:21,884 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:21,978 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 12:49:22,155 INFO L199 IcfgInterpreter]: Interpreting procedure check with input of size 8 for LOIs [2019-10-07 12:49:22,158 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 12:49:22,162 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 12:49:22,162 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 12:49:22,163 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 370#(and (or (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (<= 0 |main_#t~ret17|) (= |main_#t~ret17| 1) (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= |main_#t~ret17| 0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 0 |main_#t~ret17|))) (<= |main_#t~ret17| 1)) [2019-10-07 12:49:22,163 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 407#(and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4))))) [2019-10-07 12:49:22,163 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 426#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 12:49:22,163 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 397#(and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4))))) [2019-10-07 12:49:22,164 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 73#(and (<= 10 main_~j~0) (not (< main_~j~0 10))) [2019-10-07 12:49:22,164 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 68#true [2019-10-07 12:49:22,164 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 353#(<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) [2019-10-07 12:49:22,164 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 343#true [2019-10-07 12:49:22,164 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:49:22,165 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 12:49:22,165 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 190#(and (<= 0 main_~i~0) (<= main_~i~0 9) (<= 10 main_~j~0)) [2019-10-07 12:49:22,165 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 431#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:49:22,165 INFO L193 IcfgInterpreter]: Reachable states at location checkEXIT satisfy 422#(and (= check_~pc.base |check_#in~pc.base|) (<= |check_#res| 1) (= |check_#in~i| check_~i) (exists ((v_main_~pa~0.base_BEFORE_CALL_9 Int) (v_main_~pa~0.offset_BEFORE_CALL_9 Int)) (<= (select (select |#memory_int| v_main_~pa~0.base_BEFORE_CALL_9) v_main_~pa~0.offset_BEFORE_CALL_9) |check_#in~i|)) (= |check_#res| (ite (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| check_~pc.base) check_~pc.offset)) (+ (select (select |#memory_$Pointer$.offset| check_~pc.base) check_~pc.offset) (* 4 check_~i)))) 4)) check_~i) 1 0)) (= check_~pc.offset |check_#in~pc.offset|) (<= 0 |check_#res|)) [2019-10-07 12:49:22,165 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 12:49:22,166 INFO L193 IcfgInterpreter]: Reachable states at location L40-1 satisfy 348#(= |main_#t~mem15| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) [2019-10-07 12:49:22,166 INFO L193 IcfgInterpreter]: Reachable states at location checkENTRY satisfy 417#(exists ((v_main_~pa~0.base_BEFORE_CALL_9 Int) (v_main_~pa~0.offset_BEFORE_CALL_9 Int)) (<= (select (select |#memory_int| v_main_~pa~0.base_BEFORE_CALL_9) v_main_~pa~0.offset_BEFORE_CALL_9) |check_#in~i|)) [2019-10-07 12:49:22,166 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 412#(and (or (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (<= |main_#t~ret17| 2147483647) (<= 0 |main_#t~ret17|) (<= 0 (+ |main_#t~ret17| 2147483648)) (= |main_#t~ret17| 1) (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (and (<= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= |main_#t~ret17| 0) (<= |main_#t~ret17| 2147483647) (<= 0 |main_#t~ret17|) (not (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (* 4 main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) 4)))) (<= 0 (+ |main_#t~ret17| 2147483648)))) (<= |main_#t~ret17| 1)) [2019-10-07 12:49:23,019 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 12:49:23,019 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 7, 13] total 41 [2019-10-07 12:49:23,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-07 12:49:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-07 12:49:23,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1511, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 12:49:23,022 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 41 states. [2019-10-07 12:49:27,167 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2019-10-07 12:49:27,402 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-10-07 12:49:27,627 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 64 [2019-10-07 12:49:27,806 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-07 12:49:28,008 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-07 12:49:28,532 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-10-07 12:49:29,731 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-07 12:49:29,928 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-07 12:49:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:49:29,939 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-10-07 12:49:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-07 12:49:29,939 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 30 [2019-10-07 12:49:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:49:29,940 INFO L225 Difference]: With dead ends: 46 [2019-10-07 12:49:29,941 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 12:49:29,944 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=661, Invalid=4451, Unknown=0, NotChecked=0, Total=5112 [2019-10-07 12:49:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 12:49:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-07 12:49:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-07 12:49:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-07 12:49:29,953 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2019-10-07 12:49:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:49:29,954 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-07 12:49:29,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-07 12:49:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-07 12:49:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 12:49:29,955 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:49:29,955 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:49:30,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:30,161 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:49:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:49:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1430980571, now seen corresponding path program 3 times [2019-10-07 12:49:30,162 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:49:30,162 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:30,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:30,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:49:30,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:49:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:49:31,271 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 36 [2019-10-07 12:49:31,556 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 39 [2019-10-07 12:49:31,933 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 57 [2019-10-07 12:49:32,336 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 50 [2019-10-07 12:49:32,738 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 42 [2019-10-07 12:49:33,263 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 46 [2019-10-07 12:49:33,847 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 45 [2019-10-07 12:49:34,284 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 39 [2019-10-07 12:49:34,597 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 31 [2019-10-07 12:49:35,652 WARN L191 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 77 [2019-10-07 12:49:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 12:49:36,164 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:49:36,164 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:49:36,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:36,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 12:49:36,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 12:49:36,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-07 12:49:36,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:49:36,420 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-07 12:49:36,566 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-07 12:49:36,700 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-07 12:49:36,855 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-07 12:49:37,547 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 32 [2019-10-07 12:49:37,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:49:37,867 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) 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) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 12:49:37,875 INFO L168 Benchmark]: Toolchain (without parser) took 37295.89 ms. Allocated memory was 144.2 MB in the beginning and 464.0 MB in the end (delta: 319.8 MB). Free memory was 101.5 MB in the beginning and 327.4 MB in the end (delta: -226.0 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2019-10-07 12:49:37,876 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 144.2 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 12:49:37,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.43 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 180.4 MB in the end (delta: -79.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-10-07 12:49:37,881 INFO L168 Benchmark]: Boogie Preprocessor took 45.43 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-07 12:49:37,882 INFO L168 Benchmark]: RCFGBuilder took 526.52 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 155.6 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-10-07 12:49:37,882 INFO L168 Benchmark]: TraceAbstraction took 36185.95 ms. Allocated memory was 201.9 MB in the beginning and 464.0 MB in the end (delta: 262.1 MB). Free memory was 155.6 MB in the beginning and 327.4 MB in the end (delta: -171.8 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. [2019-10-07 12:49:37,884 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 144.2 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 533.43 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 180.4 MB in the end (delta: -79.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.43 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.52 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 155.6 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36185.95 ms. Allocated memory was 201.9 MB in the beginning and 464.0 MB in the end (delta: 262.1 MB). Free memory was 155.6 MB in the beginning and 327.4 MB in the end (delta: -171.8 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...