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_Camel+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 11:39:14,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:39:14,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:39:14,941 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:39:14,941 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:39:14,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:39:14,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:39:14,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:39:14,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:39:14,947 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:39:14,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:39:14,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:39:14,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:39:14,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:39:14,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:39:14,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:39:14,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:39:14,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:39:14,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:39:14,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:39:14,963 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:39:14,963 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:39:14,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:39:14,964 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:39:14,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:39:14,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:39:14,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:39:14,967 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:39:14,967 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:39:14,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:39:14,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:39:14,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:39:14,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:39:14,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:39:14,979 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:39:14,979 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:39:14,979 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:39:14,980 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:39:14,980 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:39:14,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:39:14,981 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:39:14,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:39:14,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:39:14,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:39:14,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:39:14,982 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:39:14,982 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:39:14,982 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:39:14,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:39:14,982 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:39:14,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:39:14,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:39:14,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:39:14,983 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:39:14,983 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:39:14,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:39:14,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:39:14,984 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:39:14,984 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:39:14,984 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:39:14,985 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:39:14,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:39:14,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:39:14,985 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:39:14,986 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:39:14,986 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:39:15,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:39:15,034 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:39:15,038 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:39:15,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:39:15,040 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:39:15,041 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 11:39:15,217 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:39:15,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:39:15,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:39:15,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:39:15,231 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:39:15,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15, skipping insertion in model container [2018-01-24 11:39:15,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,254 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:39:15,295 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:39:15,419 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:39:15,436 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:39:15,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15 WrapperNode [2018-01-24 11:39:15,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:39:15,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:39:15,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:39:15,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:39:15,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (1/1) ... [2018-01-24 11:39:15,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:39:15,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:39:15,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:39:15,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:39:15,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (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 11:39:15,529 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:39:15,529 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:39:15,529 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-24 11:39:15,529 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:39:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:39:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:39:15,530 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:39:15,530 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:39:15,530 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:39:15,530 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:39:15,530 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-24 11:39:15,531 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:39:15,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:39:15,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:39:15,719 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:39:15,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:39:15 BoogieIcfgContainer [2018-01-24 11:39:15,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:39:15,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:39:15,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:39:15,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:39:15,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:39:15" (1/3) ... [2018-01-24 11:39:15,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1a76f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:39:15, skipping insertion in model container [2018-01-24 11:39:15,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:15" (2/3) ... [2018-01-24 11:39:15,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1a76f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:39:15, skipping insertion in model container [2018-01-24 11:39:15,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:39:15" (3/3) ... [2018-01-24 11:39:15,728 INFO L105 eAbstractionObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:39:15,738 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:39:15,744 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 11:39:15,795 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:39:15,796 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:39:15,796 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:39:15,796 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:39:15,796 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:39:15,796 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:39:15,796 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:39:15,797 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:39:15,797 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:39:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-24 11:39:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:39:15,826 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:15,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:15,828 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times [2018-01-24 11:39:15,836 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:15,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:15,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:15,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:15,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:15,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:16,105 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 11:39:16,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:16,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:39:16,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:39:16,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:39:16,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:39:16,122 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 6 states. [2018-01-24 11:39:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:16,341 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-01-24 11:39:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:39:16,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 11:39:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:16,356 INFO L225 Difference]: With dead ends: 62 [2018-01-24 11:39:16,356 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 11:39:16,360 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:39:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 11:39:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 11:39:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 11:39:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-24 11:39:16,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-24 11:39:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:16,397 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-24 11:39:16,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:39:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-24 11:39:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:39:16,398 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:16,398 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:16,398 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times [2018-01-24 11:39:16,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:16,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:16,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:16,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:16,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:16,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:16,567 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 11:39:16,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:16,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:39:16,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:39:16,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:39:16,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:39:16,570 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-01-24 11:39:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:16,713 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-01-24 11:39:16,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:39:16,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-24 11:39:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:16,718 INFO L225 Difference]: With dead ends: 48 [2018-01-24 11:39:16,718 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:39:16,719 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:39:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:39:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-01-24 11:39:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:39:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 11:39:16,728 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15 [2018-01-24 11:39:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:16,729 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 11:39:16,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:39:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 11:39:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:39:16,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:16,730 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 11:39:16,730 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times [2018-01-24 11:39:16,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:16,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:16,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:16,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:16,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:16,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:16,801 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 11:39:16,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:16,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:39:16,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:39:16,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:39:16,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:39:16,802 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-01-24 11:39:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:16,868 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-24 11:39:16,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:39:16,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 11:39:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:16,870 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:39:16,870 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 11:39:16,870 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 11:39:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 11:39:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-01-24 11:39:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:39:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 11:39:16,877 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-24 11:39:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:16,877 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 11:39:16,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:39:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 11:39:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:39:16,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:16,878 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 11:39:16,878 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times [2018-01-24 11:39:16,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:16,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:16,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:16,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:16,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:16,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:16,985 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 11:39:16,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:16,986 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:39:16,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:17,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:17,094 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 11:39:17,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:39:17,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-01-24 11:39:17,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:39:17,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:39:17,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:39:17,131 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-01-24 11:39:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:17,278 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-24 11:39:17,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:39:17,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-01-24 11:39:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:17,279 INFO L225 Difference]: With dead ends: 86 [2018-01-24 11:39:17,279 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 11:39:17,280 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:39:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 11:39:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-24 11:39:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 11:39:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-24 11:39:17,287 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2018-01-24 11:39:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:17,288 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-24 11:39:17,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:39:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-24 11:39:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:39:17,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:17,289 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 11:39:17,289 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times [2018-01-24 11:39:17,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:17,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:17,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:17,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:17,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:17,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:17,439 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 11:39:17,439 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:17,439 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:39:17,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:17,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:17,484 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 11:39:17,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:39:17,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:39:17,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 11:39:17,654 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 11:39:17,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:39:17,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-01-24 11:39:17,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:39:17,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:39:17,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:39:17,688 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 13 states. [2018-01-24 11:39:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:17,881 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 11:39:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:39:17,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-01-24 11:39:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:17,883 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:39:17,883 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 11:39:17,883 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:39:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 11:39:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-24 11:39:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:39:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 11:39:17,897 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21 [2018-01-24 11:39:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:17,897 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 11:39:17,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:39:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 11:39:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:39:17,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:17,899 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 11:39:17,899 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times [2018-01-24 11:39:17,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:17,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:17,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:17,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:17,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:17,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:17,982 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 11:39:17,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:17,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:39:17,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:39:17,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:39:17,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:39:17,984 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-01-24 11:39:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:18,062 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-24 11:39:18,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:39:18,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 11:39:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:18,063 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:39:18,063 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:39:18,064 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 11:39:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:39:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:39:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:39:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:39:18,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-24 11:39:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:18,065 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:39:18,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:39:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:39:18,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:39:18,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:39:18,391 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-01-24 11:39:19,408 WARN L146 SmtUtils]: Spent 1012ms on a formula simplification. DAG size of input: 54 DAG size of output 47 [2018-01-24 11:39:19,432 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,432 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:39:19,433 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,433 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_2 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |test_fun_#in~a.base|)) (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_2)))))) (and (or .cse0 .cse1 (< 1 |test_fun_#in~N|) (<= test_fun_~N 1) .cse2 .cse3) (let ((.cse4 (= test_fun_~a.offset 0)) (.cse5 (= 1 (select |#valid| test_fun_~a.base))) (.cse6 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| test_fun_~a.base)))))) (or .cse0 .cse1 (and (<= 4 (select |#length| test_fun_~a.base)) .cse4 .cse5 (<= |test_fun_#in~N| test_fun_~N) .cse6 (<= 0 test_fun_~i~2)) .cse2 (and .cse4 .cse5 .cse6 (<= 1 test_fun_~i~2)) .cse3)))) [2018-01-24 11:39:19,433 INFO L401 ceAbstractionStarter]: For program point test_funFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-24 11:39:19,433 INFO L401 ceAbstractionStarter]: For program point L544''''(lines 544 549) no Hoare annotation was computed. [2018-01-24 11:39:19,433 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 11:39:19,433 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 548) no Hoare annotation was computed. [2018-01-24 11:39:19,433 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2018-01-24 11:39:19,434 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,434 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,434 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,434 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 11:39:19,434 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 548) the Hoare annotation is: (let ((.cse0 (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)) (.cse4 (= test_fun_~i~2 0)) (.cse7 (not (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |test_fun_#in~a.base|)) (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_2)))))) (and (or .cse0 (let ((.cse1 (= test_fun_~a.offset 0)) (.cse2 (= 1 (select |#valid| test_fun_~a.base))) (.cse3 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| test_fun_~a.base)))))) (or (and (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| test_fun_~a.base)) (<= (+ test_fun_~i~2 1) v_main_~array_size~5_BEFORE_CALL_2))) .cse1 .cse2 .cse3 (<= 1 test_fun_~i~2)) (and (<= 4 (select |#length| test_fun_~a.base)) .cse1 .cse4 .cse2 (<= |test_fun_#in~N| test_fun_~N) .cse3))) .cse5 .cse6 .cse7) (or .cse0 .cse5 (< 1 |test_fun_#in~N|) .cse6 (and .cse4 (<= test_fun_~N 1)) .cse7))) [2018-01-24 11:39:19,434 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-24 11:39:19,434 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L404 ceAbstractionStarter]: At program point test_funENTRY(lines 540 551) the Hoare annotation is: true [2018-01-24 11:39:19,435 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L401 ceAbstractionStarter]: For program point L544''(lines 544 549) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-24 11:39:19,435 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,435 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-24 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 559) no Hoare annotation was computed. [2018-01-24 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 556) no Hoare annotation was computed. [2018-01-24 11:39:19,436 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 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 559) no Hoare annotation was computed. [2018-01-24 11:39:19,436 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 552 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 556) no Hoare annotation was computed. [2018-01-24 11:39:19,436 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 11:39:19,437 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 11:39:19,437 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 559) no Hoare annotation was computed. [2018-01-24 11:39:19,443 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,444 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,444 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,445 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,445 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,445 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,445 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,446 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,446 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,446 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,448 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,454 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,454 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,456 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,456 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,456 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,461 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,461 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,461 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,462 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,462 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,462 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,463 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,463 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,463 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,468 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,468 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,468 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,470 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,470 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,470 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,471 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,471 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,471 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,471 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:39:19 BoogieIcfgContainer [2018-01-24 11:39:19,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:39:19,475 INFO L168 Benchmark]: Toolchain (without parser) took 4257.52 ms. Allocated memory was 300.9 MB in the beginning and 471.9 MB in the end (delta: 170.9 MB). Free memory was 260.8 MB in the beginning and 306.4 MB in the end (delta: -45.5 MB). Peak memory consumption was 125.4 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:19,477 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:39:19,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.12 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 249.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:19,477 INFO L168 Benchmark]: Boogie Preprocessor took 36.62 ms. Allocated memory is still 300.9 MB. Free memory was 249.7 MB in the beginning and 248.7 MB in the end (delta: 996.7 kB). Peak memory consumption was 996.7 kB. Max. memory is 5.3 GB. [2018-01-24 11:39:19,478 INFO L168 Benchmark]: RCFGBuilder took 238.00 ms. Allocated memory is still 300.9 MB. Free memory was 248.7 MB in the beginning and 232.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:19,478 INFO L168 Benchmark]: TraceAbstraction took 3753.28 ms. Allocated memory was 300.9 MB in the beginning and 471.9 MB in the end (delta: 170.9 MB). Free memory was 232.7 MB in the beginning and 306.4 MB in the end (delta: -73.7 MB). Peak memory consumption was 97.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:19,480 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.17 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.12 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 249.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.62 ms. Allocated memory is still 300.9 MB. Free memory was 249.7 MB in the beginning and 248.7 MB in the end (delta: 996.7 kB). Peak memory consumption was 996.7 kB. Max. memory is 5.3 GB. * RCFGBuilder took 238.00 ms. Allocated memory is still 300.9 MB. Free memory was 248.7 MB in the beginning and 232.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3753.28 ms. Allocated memory was 300.9 MB in the beginning and 471.9 MB in the end (delta: 170.9 MB). Free memory was 232.7 MB in the beginning and 306.4 MB in the end (delta: -73.7 MB). Peak memory consumption was 97.3 MB. Max. memory is 5.3 GB. * 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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,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 11:39:19,487 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,487 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,487 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,488 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,488 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,488 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,489 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,489 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,489 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,489 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,494 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,494 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,494 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,494 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,496 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,496 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,496 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,496 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\valid[a] == 1) || (((((\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && i + 1 <= v_main_~array_size~5_BEFORE_CALL_2) && a == 0) && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: N <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a])) && 1 <= i) || (((((4 <= unknown-#length-unknown[a] && a == 0) && i == 0) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: N <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a]))) || !(0 == a)) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && \old(N) <= v_main_~array_size~5_BEFORE_CALL_2)) && (((((!(\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_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && \old(N) <= v_main_~array_size~5_BEFORE_CALL_2)) - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 11:39:19,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,503 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,506 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:19,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[a] == 1) || !(0 == a)) || 1 < \old(N)) || N <= 1) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && \old(N) <= v_main_~array_size~5_BEFORE_CALL_2)) && (((((!(\valid[a] == 1) || !(0 == a)) || (((((4 <= unknown-#length-unknown[a] && a == 0) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: N <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a])) && 0 <= i)) || unknown-#length-unknown[a] < 4) || (((a == 0 && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: N <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a])) && 1 <= i)) || !(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && \old(N) <= v_main_~array_size~5_BEFORE_CALL_2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 7 error locations. SAFE Result, 3.6s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 SDtfs, 276 SDslu, 453 SDs, 0 SdLazy, 336 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s 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.0s AbstIntTime, 0 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 152 ConstructedInterpolants, 11 QuantifiedInterpolants, 17096 SizeOfPredicates, 9 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12/18 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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-39-19-516.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-39-19-516.csv Received shutdown request...