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/loops/array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:43:42,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:43:42,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:43:42,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:43:42,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:43:42,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:43:42,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:43:42,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:43:42,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:43:42,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:43:42,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:43:42,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:43:42,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:43:42,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:43:42,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:43:42,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:43:42,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:43:42,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:43:42,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:43:42,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:43:42,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:43:42,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:43:42,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:43:42,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:43:42,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:43:42,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:43:42,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:43:42,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:43:42,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:43:42,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:43:42,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:43:42,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:43:42,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:43:42,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:43:42,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:43:42,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:43:42,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:43:42,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:43:42,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:43:42,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:43:42,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:43:42,840 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 13:43:42,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:43:42,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:43:42,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:43:42,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:43:42,855 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:43:42,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:43:42,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:43:42,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:43:42,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:43:42,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:43:42,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:43:42,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:43:42,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:43:42,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:43:42,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:43:42,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:43:42,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:43:42,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:43:42,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:43:42,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:43:42,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:43:42,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:43:42,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:43:42,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:43:42,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:43:42,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:43:42,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:43:42,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:43:42,859 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 13:43:43,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:43:43,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:43:43,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:43:43,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:43:43,209 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:43:43,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-1.c [2019-10-07 13:43:43,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d730191e0/19ab984dc95042a19d91a242c52b11f6/FLAG64eb6cd56 [2019-10-07 13:43:43,723 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:43:43,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-1.c [2019-10-07 13:43:43,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d730191e0/19ab984dc95042a19d91a242c52b11f6/FLAG64eb6cd56 [2019-10-07 13:43:44,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d730191e0/19ab984dc95042a19d91a242c52b11f6 [2019-10-07 13:43:44,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:43:44,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:43:44,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:43:44,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:43:44,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:43:44,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9690e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44, skipping insertion in model container [2019-10-07 13:43:44,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,182 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:43:44,200 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:43:44,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:43:44,386 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:43:44,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:43:44,514 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:43:44,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44 WrapperNode [2019-10-07 13:43:44,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:43:44,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:43:44,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:43:44,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:43:44,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (1/1) ... [2019-10-07 13:43:44,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:43:44,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:43:44,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:43:44,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:43:44,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (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 13:43:44,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:43:44,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:43:44,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:43:44,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:43:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:43:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:43:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:43:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:43:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:43:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:43:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:43:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:43:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:43:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:43:44,931 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:43:44,931 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:43:44,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:43:44 BoogieIcfgContainer [2019-10-07 13:43:44,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:43:44,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:43:44,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:43:44,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:43:44,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:43:44" (1/3) ... [2019-10-07 13:43:44,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679e3ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:43:44, skipping insertion in model container [2019-10-07 13:43:44,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:44" (2/3) ... [2019-10-07 13:43:44,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679e3ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:43:44, skipping insertion in model container [2019-10-07 13:43:44,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:43:44" (3/3) ... [2019-10-07 13:43:44,939 INFO L109 eAbstractionObserver]: Analyzing ICFG array-1.c [2019-10-07 13:43:44,946 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:43:44,953 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:43:44,964 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:43:44,987 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:43:44,988 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:43:44,988 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:43:44,988 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:43:44,988 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:43:44,988 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:43:44,988 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:43:44,989 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:43:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 13:43:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:43:45,007 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:45,007 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:45,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1684679511, now seen corresponding path program 1 times [2019-10-07 13:43:45,020 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:45,021 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:45,021 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:45,021 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:45,292 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 13:43:45,293 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:45,293 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:43:45,294 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:43:45,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:43:45,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:43:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:43:45,309 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 13:43:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:45,341 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-07 13:43:45,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:43:45,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:43:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:45,350 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:43:45,350 INFO L226 Difference]: Without dead ends: 12 [2019-10-07 13:43:45,353 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 13:43:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-07 13:43:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-07 13:43:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-07 13:43:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-07 13:43:45,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-07 13:43:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:45,386 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-07 13:43:45,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:43:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-07 13:43:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:43:45,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:45,388 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:45,388 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:45,389 INFO L82 PathProgramCache]: Analyzing trace with hash -734883470, now seen corresponding path program 1 times [2019-10-07 13:43:45,389 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:45,389 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:45,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:45,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:45,714 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 13:43:45,715 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:45,715 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:45,716 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 13:43:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:45,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:43:45,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:45,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:45,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-10-07 13:43:45,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:45,998 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:43:45,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,007 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:43:46,008 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 13:43:46,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2019-10-07 13:43:46,023 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,103 INFO L567 ElimStorePlain]: treesize reduction 54, result has 56.5 percent of original size [2019-10-07 13:43:46,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2019-10-07 13:43:46,113 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,135 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-10-07 13:43:46,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-07 13:43:46,137 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:289, output treesize:40 [2019-10-07 13:43:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:43:46,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:43:46,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2019-10-07 13:43:46,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-10-07 13:43:46,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,269 INFO L567 ElimStorePlain]: treesize reduction 11, result has 65.6 percent of original size [2019-10-07 13:43:46,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-07 13:43:46,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:9 [2019-10-07 13:43:46,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,306 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 13:43:46,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:46,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-10-07 13:43:46,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-10-07 13:43:46,431 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,440 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2019-10-07 13:43:46,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 151 [2019-10-07 13:43:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:46,603 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,626 INFO L567 ElimStorePlain]: treesize reduction 239, result has 5.5 percent of original size [2019-10-07 13:43:46,627 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-10-07 13:43:46,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-10-07 13:43:46,737 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,750 INFO L567 ElimStorePlain]: treesize reduction 10, result has 58.3 percent of original size [2019-10-07 13:43:46,750 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-10-07 13:43:46,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-10-07 13:43:46,847 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,856 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:46,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-10-07 13:43:46,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-10-07 13:43:46,961 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:46,974 INFO L567 ElimStorePlain]: treesize reduction 10, result has 58.3 percent of original size [2019-10-07 13:43:46,975 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:47,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:47,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2019-10-07 13:43:47,076 INFO L341 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2019-10-07 13:43:47,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 133 [2019-10-07 13:43:47,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:43:47,108 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:47,125 INFO L567 ElimStorePlain]: treesize reduction 63, result has 27.6 percent of original size [2019-10-07 13:43:47,126 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:47,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:47,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2019-10-07 13:43:47,193 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 30 variables, input treesize:276, output treesize:115 [2019-10-07 13:43:47,268 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 13:43:47,269 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:47,293 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:43:47,294 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:47,300 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:47,308 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:47,308 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:47,439 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:43:47,633 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:43:47,654 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:43:47,660 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:47,660 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:47,661 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 13:43:47,661 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)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:47,662 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 88#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:47,662 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 97#(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 13:43:47,662 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:47,662 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 92#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:47,662 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 83#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:47,663 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 73#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:43:47,663 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 78#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:47,663 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 68#(and (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= |main_#t~mem5| (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) [2019-10-07 13:43:47,663 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 63#true [2019-10-07 13:43:47,955 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:47,956 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 20 [2019-10-07 13:43:47,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-07 13:43:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-07 13:43:47,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-10-07 13:43:47,962 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 20 states. [2019-10-07 13:43:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:48,305 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-10-07 13:43:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:43:48,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 11 [2019-10-07 13:43:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:48,306 INFO L225 Difference]: With dead ends: 12 [2019-10-07 13:43:48,306 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:43:48,308 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:43:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:43:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:43:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:43:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:43:48,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-10-07 13:43:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:48,310 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:43:48,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-07 13:43:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:43:48,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:43:48,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:48,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:43:48,807 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:48,808 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:43:48,808 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:43:48,808 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |#NULL.offset|)) [2019-10-07 13:43:48,808 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:43:48,808 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:43:48,808 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 29) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:43:48,808 INFO L439 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (and (= main_~SIZE~0 1) (= 0 |main_~#array~0.offset|) (<= main_~menor~0 |main_#t~mem5|) (= 0 (select |#valid| 0)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~SIZE~0 4294967296) (mod main_~j~0 4294967296))) (not (<= |#NULL.base| 0))) [2019-10-07 13:43:48,808 INFO L443 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-10-07 13:43:48,809 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2019-10-07 13:43:48,809 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 24) the Hoare annotation is: (let ((.cse0 (= main_~SIZE~0 1)) (.cse1 (= 0 |main_~#array~0.offset|)) (.cse2 (= 0 (select |#valid| 0)))) (or (and .cse0 .cse1 .cse2 (= main_~j~0 0)) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (and .cse0 .cse1 (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) .cse2) (not (<= |#NULL.base| 0)))) [2019-10-07 13:43:48,809 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:43:48,809 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:43:48,809 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:43:48,809 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:43:48,809 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:43:48,809 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:43:48,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:43:48,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:43:48,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:43:48 BoogieIcfgContainer [2019-10-07 13:43:48,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:43:48,831 INFO L168 Benchmark]: Toolchain (without parser) took 4666.51 ms. Allocated memory was 145.8 MB in the beginning and 244.8 MB in the end (delta: 99.1 MB). Free memory was 103.4 MB in the beginning and 174.4 MB in the end (delta: -71.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:43:48,832 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:43:48,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.94 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 103.2 MB in the beginning and 182.6 MB in the end (delta: -79.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:43:48,833 INFO L168 Benchmark]: Boogie Preprocessor took 40.12 ms. Allocated memory is still 202.4 MB. Free memory was 182.6 MB in the beginning and 179.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:43:48,834 INFO L168 Benchmark]: RCFGBuilder took 377.69 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 161.8 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:43:48,835 INFO L168 Benchmark]: TraceAbstraction took 3895.51 ms. Allocated memory was 202.4 MB in the beginning and 244.8 MB in the end (delta: 42.5 MB). Free memory was 161.2 MB in the beginning and 174.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:43:48,838 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.15 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 348.94 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 103.2 MB in the beginning and 182.6 MB in the end (delta: -79.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.12 ms. Allocated memory is still 202.4 MB. Free memory was 182.6 MB in the beginning and 179.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 377.69 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 161.8 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3895.51 ms. Allocated memory was 202.4 MB in the beginning and 244.8 MB in the end (delta: 42.5 MB). Free memory was 161.2 MB in the beginning and 174.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2019-10-07 13:43:48,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:43:48,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:43:48,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:43:48,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((((SIZE == 1 && 0 == array) && 0 == \valid[0]) && j == 0) || !(#NULL <= 0)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || (((SIZE == 1 && 0 == array) && menor <= unknown-#memory_int-unknown[array][array]) && 0 == \valid[0])) || !(#NULL <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 3.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 51 SDs, 0 SdLazy, 71 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 10 NumberOfFragments, 172 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 129 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 39 ConstructedInterpolants, 2 QuantifiedInterpolants, 1560 SizeOfPredicates, 14 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 370, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 20, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 9, TOOLS_POST_TIME[ms]: 105, TOOLS_POST_CALL_APPLICATIONS: 5, TOOLS_POST_CALL_TIME[ms]: 8, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME[ms]: 1, TOOLS_QUANTIFIERELIM_APPLICATIONS: 16, TOOLS_QUANTIFIERELIM_TIME[ms]: 107, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 68, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 22, FLUID_YES_ANSWERS: 1, DOMAIN_JOIN_APPLICATIONS: 17, DOMAIN_JOIN_TIME[ms]: 177, DOMAIN_ALPHA_APPLICATIONS: 1, DOMAIN_ALPHA_TIME[ms]: 5, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 3, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 3, DOMAIN_ISBOTTOM_APPLICATIONS: 1, DOMAIN_ISBOTTOM_TIME[ms]: 2, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 116, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 114, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME[ms]: 30, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 30, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 10, DAG_COMPRESSION_PROCESSED_NODES: 57, DAG_COMPRESSION_RETAINED_NODES: 41, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...