java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:11:23,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:11:23,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:11:23,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:11:23,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:11:23,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:11:23,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:11:23,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:11:23,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:11:23,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:11:23,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:11:23,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:11:23,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:11:23,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:11:23,807 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:11:23,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:11:23,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:11:23,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:11:23,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:11:23,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:11:23,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:11:23,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:11:23,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:11:23,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:11:23,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:11:23,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:11:23,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:11:23,824 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:11:23,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:11:23,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:11:23,825 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:11:23,825 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:11:23,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:11:23,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:11:23,835 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:11:23,836 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:11:23,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:11:23,836 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:11:23,836 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:11:23,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:11:23,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:11:23,837 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:11:23,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:11:23,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:11:23,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:11:23,838 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:11:23,838 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:11:23,838 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:11:23,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:11:23,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:11:23,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:11:23,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:11:23,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:11:23,840 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:11:23,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:11:23,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:11:23,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:11:23,841 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:11:23,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:11:23,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:11:23,841 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:11:23,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:11:23,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:11:23,842 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:11:23,842 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:11:23,843 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:11:23,843 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:11:23,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:11:23,893 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:11:23,897 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:11:23,899 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:11:23,899 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:11:23,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:11:24,095 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:11:24,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:11:24,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:11:24,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:11:24,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:11:24,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f741a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24, skipping insertion in model container [2018-01-24 15:11:24,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,127 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:11:24,167 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:11:24,279 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:11:24,294 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:11:24,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24 WrapperNode [2018-01-24 15:11:24,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:11:24,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:11:24,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:11:24,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:11:24,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... [2018-01-24 15:11:24,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:11:24,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:11:24,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:11:24,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:11:24,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (1/1) ... No working directory specified, using /storage/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 [2018-01-24 15:11:24,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:11:24,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:11:24,385 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-24 15:11:24,386 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:11:24,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:11:24,387 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:11:24,566 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:11:24,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:11:24 BoogieIcfgContainer [2018-01-24 15:11:24,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:11:24,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:11:24,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:11:24,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:11:24,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:11:24" (1/3) ... [2018-01-24 15:11:24,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ffa309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:11:24, skipping insertion in model container [2018-01-24 15:11:24,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:11:24" (2/3) ... [2018-01-24 15:11:24,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ffa309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:11:24, skipping insertion in model container [2018-01-24 15:11:24,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:11:24" (3/3) ... [2018-01-24 15:11:24,574 INFO L105 eAbstractionObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:11:24,583 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:11:24,590 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 15:11:24,634 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:11:24,634 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:11:24,634 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:11:24,634 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:11:24,634 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:11:24,635 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:11:24,635 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:11:24,635 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:11:24,636 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:11:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-24 15:11:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:11:24,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:11:24,664 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:11:24,664 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 15:11:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times [2018-01-24 15:11:24,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:11:24,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:24,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:24,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:24,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:11:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:24,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:11:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:24,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:11:24,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:11:24,915 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:11:24,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:11:24,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:11:24,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:11:24,930 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 6 states. [2018-01-24 15:11:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:11:25,136 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-01-24 15:11:25,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:11:25,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 15:11:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:11:25,147 INFO L225 Difference]: With dead ends: 62 [2018-01-24 15:11:25,148 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 15:11:25,151 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:11:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 15:11:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 15:11:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 15:11:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-24 15:11:25,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-24 15:11:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:11:25,186 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-24 15:11:25,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:11:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-24 15:11:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:11:25,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:11:25,187 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:11:25,187 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 15:11:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times [2018-01-24 15:11:25,187 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:11:25,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:25,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:25,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:25,189 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:11:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:25,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:11:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:25,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:11:25,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:11:25,349 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:11:25,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:11:25,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:11:25,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:11:25,351 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-01-24 15:11:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:11:25,517 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-01-24 15:11:25,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:11:25,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-24 15:11:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:11:25,522 INFO L225 Difference]: With dead ends: 48 [2018-01-24 15:11:25,522 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 15:11:25,523 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:11:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 15:11:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-01-24 15:11:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 15:11:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 15:11:25,532 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15 [2018-01-24 15:11:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:11:25,532 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 15:11:25,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:11:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 15:11:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 15:11:25,534 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:11:25,534 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:11:25,534 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 15:11:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times [2018-01-24 15:11:25,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:11:25,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:25,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:25,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:25,536 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:11:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:25,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:11:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:25,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:11:25,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:11:25,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:11:25,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:11:25,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:11:25,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:11:25,607 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-01-24 15:11:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:11:25,661 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-24 15:11:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:11:25,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 15:11:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:11:25,662 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:11:25,663 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 15:11:25,663 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:11:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 15:11:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-01-24 15:11:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 15:11:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 15:11:25,670 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-24 15:11:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:11:25,670 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 15:11:25,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:11:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 15:11:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:11:25,671 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:11:25,672 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:11:25,672 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 15:11:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times [2018-01-24 15:11:25,672 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:11:25,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:25,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:25,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:25,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:11:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:25,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:11:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:25,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:11:25,814 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:11:25,815 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-24 15:11:25,816 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [48], [52], [53], [60], [61], [62], [64] [2018-01-24 15:11:25,863 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:11:25,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:11:26,143 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:11:26,144 INFO L268 AbstractInterpreter]: Visited 18 different actions 25 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 15:11:26,156 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:11:26,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:11:26,157 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:11:26,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:26,166 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:11:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:26,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:11:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:26,256 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:11:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:26,325 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:11:26,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 14 [2018-01-24 15:11:26,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:11:26,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:11:26,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:11:26,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:11:26,327 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-24 15:11:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:11:26,399 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-24 15:11:26,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:11:26,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 15:11:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:11:26,401 INFO L225 Difference]: With dead ends: 86 [2018-01-24 15:11:26,401 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:11:26,402 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:11:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:11:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-24 15:11:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 15:11:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-24 15:11:26,412 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2018-01-24 15:11:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:11:26,412 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-24 15:11:26,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:11:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-24 15:11:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:11:26,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:11:26,414 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:11:26,414 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 15:11:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times [2018-01-24 15:11:26,414 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:11:26,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:26,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:26,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:26,416 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:11:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:26,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:11:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:26,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:11:26,565 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:11:26,565 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-24 15:11:26,565 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [50], [52], [53], [60], [61], [62], [64] [2018-01-24 15:11:26,566 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:11:26,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:11:26,702 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:11:26,702 INFO L268 AbstractInterpreter]: Visited 18 different actions 25 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 15:11:26,709 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:11:26,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:11:26,710 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:11:26,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:26,722 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:11:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:26,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:11:26,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-24 15:11:26,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:11:26,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:11:26,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 15:11:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:26,951 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:11:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:27,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:11:27,268 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:11:27,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:27,274 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:11:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:27,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:11:27,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-24 15:11:27,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:11:27,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:11:27,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 15:11:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:27,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:11:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:11:27,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:11:27,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-24 15:11:27,423 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:11:27,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:11:27,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:11:27,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:11:27,425 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 13 states. [2018-01-24 15:11:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:11:27,729 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 15:11:27,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:11:27,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-01-24 15:11:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:11:27,731 INFO L225 Difference]: With dead ends: 61 [2018-01-24 15:11:27,731 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 15:11:27,732 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-01-24 15:11:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 15:11:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-24 15:11:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:11:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 15:11:27,743 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21 [2018-01-24 15:11:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:11:27,743 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 15:11:27,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:11:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 15:11:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:11:27,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:11:27,744 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:11:27,745 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 15:11:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times [2018-01-24 15:11:27,745 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:11:27,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:27,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:11:27,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:11:27,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:11:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:11:27,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:11:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:11:27,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:11:27,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:11:27,825 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:11:27,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:11:27,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:11:27,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:11:27,825 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-01-24 15:11:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:11:27,881 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-24 15:11:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:11:27,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 15:11:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:11:27,881 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:11:27,881 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:11:27,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:11:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:11:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:11:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:11:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:11:27,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-24 15:11:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:11:27,883 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:11:27,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:11:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:11:27,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:11:27,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:11:28,806 WARN L146 SmtUtils]: Spent 850ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-01-24 15:11:29,478 WARN L146 SmtUtils]: Spent 666ms on a formula simplification. DAG size of input: 54 DAG size of output 47 [2018-01-24 15:11:29,501 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,501 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:11:29,501 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 549) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse1 (not (= 0 |test_fun_#in~a.offset|))) (.cse2 (< (select |#length| |test_fun_#in~a.base|) 4)) (.cse3 (not (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |test_fun_#in~a.base|))))))) (and (or .cse0 .cse1 (< 1 |test_fun_#in~N|) .cse2 (<= test_fun_~N 1) .cse3) (let ((.cse5 (= test_fun_~a.offset 0)) (.cse6 (= 1 (select |#valid| test_fun_~a.base))) (.cse4 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| test_fun_~a.base)))))) (or .cse0 (and .cse4 .cse5 .cse6 (<= 1 test_fun_~i~2)) .cse1 (and (<= 4 (select |#length| test_fun_~a.base)) .cse5 .cse6 (<= |test_fun_#in~N| test_fun_~N) .cse4 (<= 0 test_fun_~i~2)) .cse2 .cse3)))) [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point test_funFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point L544''''(lines 544 549) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 548) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 15:11:29,502 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 548) the Hoare annotation is: (let ((.cse4 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse5 (not (= 0 |test_fun_#in~a.offset|))) (.cse6 (< (select |#length| |test_fun_#in~a.base|) 4)) (.cse2 (= test_fun_~i~2 0)) (.cse7 (not (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |test_fun_#in~a.base|))))))) (and (or (let ((.cse0 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| test_fun_~a.base))))) (.cse1 (= test_fun_~a.offset 0)) (.cse3 (= 1 (select |#valid| test_fun_~a.base)))) (or (and (<= 4 (select |#length| test_fun_~a.base)) .cse0 .cse1 .cse2 .cse3 (<= |test_fun_#in~N| test_fun_~N)) (and .cse0 .cse1 .cse3 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= (+ test_fun_~i~2 1) v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| test_fun_~a.base)))) (<= 1 test_fun_~i~2)))) .cse4 .cse5 .cse6 .cse7) (or .cse4 .cse5 (< 1 |test_fun_#in~N|) .cse6 (and .cse2 (<= test_fun_~N 1)) .cse7))) [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L404 ceAbstractionStarter]: At program point test_funENTRY(lines 540 551) the Hoare annotation is: true [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point L544''(lines 544 549) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,503 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-24 15:11:29,503 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 559) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 556) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L397 ceAbstractionStarter]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= .cse0 (select |#length| main_~numbers~5.base)) (= 0 main_~numbers~5.offset) (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| main_~numbers~5.base)) (<= 1 main_~array_size~5) (= .cse0 (select |#length| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|) (= 1 (select |#valid| |main_#t~malloc6.base|)))) [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 559) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 552 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 556) no Hoare annotation was computed. [2018-01-24 15:11:29,504 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 15:11:29,505 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 15:11:29,505 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 559) no Hoare annotation was computed. [2018-01-24 15:11:29,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,512 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,512 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,522 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,522 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,522 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,523 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,523 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:11:29 BoogieIcfgContainer [2018-01-24 15:11:29,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:11:29,543 INFO L168 Benchmark]: Toolchain (without parser) took 5446.88 ms. Allocated memory was 302.0 MB in the beginning and 509.6 MB in the end (delta: 207.6 MB). Free memory was 261.0 MB in the beginning and 376.8 MB in the end (delta: -115.8 MB). Peak memory consumption was 91.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:11:29,544 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:11:29,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.19 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:11:29,544 INFO L168 Benchmark]: Boogie Preprocessor took 35.73 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:11:29,544 INFO L168 Benchmark]: RCFGBuilder took 230.18 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 234.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-24 15:11:29,545 INFO L168 Benchmark]: TraceAbstraction took 4974.11 ms. Allocated memory was 302.0 MB in the beginning and 509.6 MB in the end (delta: 207.6 MB). Free memory was 234.3 MB in the beginning and 376.8 MB in the end (delta: -142.5 MB). Peak memory consumption was 65.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:11:29,547 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.19 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.73 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 230.18 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 234.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4974.11 ms. Allocated memory was 302.0 MB in the beginning and 509.6 MB in the end (delta: 207.6 MB). Free memory was 234.3 MB in the beginning and 376.8 MB in the end (delta: -142.5 MB). Peak memory consumption was 65.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 145 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 39 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.044718 RENAME_VARIABLES(MILLISECONDS) : 0.487703 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.990676 PROJECTAWAY(MILLISECONDS) : 0.272931 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.191103 DISJOIN(MILLISECONDS) : 2.048378 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.524646 ADD_EQUALITY(MILLISECONDS) : 0.044624 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.046824 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 64 #PROJECTAWAY : 56 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 39 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 138 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.860867 RENAME_VARIABLES(MILLISECONDS) : 0.322782 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.797312 PROJECTAWAY(MILLISECONDS) : 0.251273 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.097300 DISJOIN(MILLISECONDS) : 0.483213 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.357486 ADD_EQUALITY(MILLISECONDS) : 0.040992 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014450 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 64 #PROJECTAWAY : 56 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-24 15:11:29,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,558 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,558 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,558 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,558 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((4 <= unknown-#length-unknown[a] && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && a == 0) && i == 0) && 1 == \valid[a]) && \old(N) <= N) || (((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a]) && a == 0) && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: i + 1 <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && 1 <= i)) || !(\valid[a] == 1)) || !(0 == a)) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && (((((!(\valid[a] == 1) || !(0 == a)) || 1 < \old(N)) || unknown-#length-unknown[a] < 4) || (i == 0 && N <= 1)) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 15:11:29,568 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,568 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,568 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,570 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:11:29,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,575 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,575 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,575 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,575 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:11:29,575 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[a] == 1) || !(0 == a)) || 1 < \old(N)) || unknown-#length-unknown[a] < 4) || N <= 1) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && (((((!(\valid[a] == 1) || ((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a]) && a == 0) && 1 == \valid[a]) && 1 <= i)) || !(0 == a)) || (((((4 <= unknown-#length-unknown[a] && a == 0) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && 0 <= i)) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 7 error locations. SAFE Result, 4.8s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 245 SDslu, 373 SDs, 0 SdLazy, 294 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 321 HoareAnnotationTreeSize, 11 FomulaSimplifications, 49 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 478 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 232 ConstructedInterpolants, 40 QuantifiedInterpolants, 40156 SizeOfPredicates, 19 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 18/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-11-29-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-11-29-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-11-29-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-11-29-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-11-29-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-11-29-581.csv Received shutdown request...