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/array02-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:39:21,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:39:21,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:39:21,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:39:21,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:39:21,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:39:21,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:39:21,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:39:21,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:39:21,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:39:21,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:39:21,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:39:21,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:39:21,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:39:21,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:39:21,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:39:21,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:39:21,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:39:21,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:39:21,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:39:21,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:39:21,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:39:21,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:39:21,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:39:21,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:39:21,313 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:39:21,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:39:21,314 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:39:21,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:39:21,315 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:39:21,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:39:21,316 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:21,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:39:21,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:39:21,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:39:21,328 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:39:21,328 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:39:21,328 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:39:21,329 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:39:21,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:39:21,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:39:21,330 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:39:21,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:39:21,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:39:21,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:39:21,330 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:39:21,331 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:39:21,331 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:39:21,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:39:21,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:39:21,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:39:21,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:39:21,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:39:21,332 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:39:21,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:39:21,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:39:21,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:39:21,333 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:39:21,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:39:21,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:39:21,333 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:39:21,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:39:21,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:39:21,334 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:39:21,335 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:39:21,335 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:39:21,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:39:21,382 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:39:21,386 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:39:21,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:39:21,388 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:39:21,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:39:21,557 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:39:21,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:39:21,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:39:21,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:39:21,572 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:39:21,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:39:21" (1/1) ... [2018-01-24 11:39:21,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:21, skipping insertion in model container [2018-01-24 11:39:21,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:39:21" (1/1) ... [2018-01-24 11:39:21,595 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:39:21,636 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:39:21,744 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:39:21,760 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:39:21,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:21 WrapperNode [2018-01-24 11:39:21,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:39:21,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:39:21,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:39:21,769 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:39:21,785 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:21" (1/1) ... [2018-01-24 11:39:21,785 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:21" (1/1) ... [2018-01-24 11:39:21,795 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:21" (1/1) ... [2018-01-24 11:39:21,796 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:21" (1/1) ... [2018-01-24 11:39:21,799 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:21" (1/1) ... [2018-01-24 11:39:21,802 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:21" (1/1) ... [2018-01-24 11:39:21,803 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:21" (1/1) ... [2018-01-24 11:39:21,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:39:21,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:39:21,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:39:21,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:39:21,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:21" (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:21,851 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:39:21,852 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:39:21,852 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-24 11:39:21,852 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:39:21,852 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:39:21,852 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:39:21,852 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:39:21,852 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:39:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:39:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:39:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-24 11:39:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:39:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:39:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:39:22,083 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:39:22,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:39:22 BoogieIcfgContainer [2018-01-24 11:39:22,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:39:22,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:39:22,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:39:22,086 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:39:22,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:39:21" (1/3) ... [2018-01-24 11:39:22,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e005102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:39:22, skipping insertion in model container [2018-01-24 11:39:22,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:21" (2/3) ... [2018-01-24 11:39:22,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e005102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:39:22, skipping insertion in model container [2018-01-24 11:39:22,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:39:22" (3/3) ... [2018-01-24 11:39:22,089 INFO L105 eAbstractionObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:39:22,095 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:39:22,101 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 11:39:22,137 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:39:22,137 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:39:22,137 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:39:22,138 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:39:22,138 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:39:22,138 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:39:22,138 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:39:22,138 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:39:22,139 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:39:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-24 11:39:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:39:22,168 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:22,169 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:22,169 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1926055157, now seen corresponding path program 1 times [2018-01-24 11:39:22,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:22,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:22,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:22,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:22,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:22,281 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:22,407 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:22,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:22,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:39:22,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:39:22,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:39:22,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:39:22,432 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 6 states. [2018-01-24 11:39:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:22,701 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-01-24 11:39:22,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:39:22,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 11:39:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:22,714 INFO L225 Difference]: With dead ends: 81 [2018-01-24 11:39:22,714 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 11:39:22,718 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:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 11:39:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 11:39:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 11:39:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 11:39:22,756 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2018-01-24 11:39:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:22,756 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 11:39:22,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:39:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 11:39:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:39:22,757 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:22,757 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:22,757 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1926055156, now seen corresponding path program 1 times [2018-01-24 11:39:22,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:22,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:22,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:22,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:22,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:22,781 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:22,965 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:22,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:22,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:39:22,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:39:22,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:39:22,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:39:22,968 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-01-24 11:39:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:23,172 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-24 11:39:23,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:39:23,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-24 11:39:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:23,175 INFO L225 Difference]: With dead ends: 65 [2018-01-24 11:39:23,175 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 11:39:23,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:39:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 11:39:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-01-24 11:39:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 11:39:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-24 11:39:23,185 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 15 [2018-01-24 11:39:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:23,186 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-24 11:39:23,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:39:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-24 11:39:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 11:39:23,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:23,187 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:23,187 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1643065362, now seen corresponding path program 1 times [2018-01-24 11:39:23,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:23,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:23,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:23,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:23,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:23,201 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:23,243 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:23,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:23,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:39:23,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:39:23,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:39:23,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:39:23,245 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 5 states. [2018-01-24 11:39:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:23,323 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-01-24 11:39:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:39:23,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 11:39:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:23,324 INFO L225 Difference]: With dead ends: 63 [2018-01-24 11:39:23,324 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 11:39:23,325 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:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 11:39:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-24 11:39:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 11:39:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-24 11:39:23,333 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2018-01-24 11:39:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:23,333 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-24 11:39:23,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:39:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-24 11:39:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:39:23,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:23,335 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:23,335 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash 417458597, now seen corresponding path program 1 times [2018-01-24 11:39:23,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:23,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:23,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:23,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:23,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:23,352 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:23,463 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:23,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:23,463 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:23,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:23,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:23,548 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:23,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:39:23,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-01-24 11:39:23,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:39:23,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:39:23,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:39:23,569 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2018-01-24 11:39:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:23,775 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-01-24 11:39:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:39:23,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-01-24 11:39:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:23,777 INFO L225 Difference]: With dead ends: 114 [2018-01-24 11:39:23,777 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 11:39:23,778 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 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:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 11:39:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-01-24 11:39:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 11:39:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-24 11:39:23,789 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 24 [2018-01-24 11:39:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:23,789 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-24 11:39:23,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:39:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-24 11:39:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:39:23,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:23,791 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:23,791 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1576686109, now seen corresponding path program 1 times [2018-01-24 11:39:23,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:23,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:23,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:23,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:23,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:23,807 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:23,956 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:23,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:23,957 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:23,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:23,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:24,017 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:24,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:39:24,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:39:24,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 11:39:24,287 WARN L143 SmtUtils]: Spent 222ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-24 11:39:24,415 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:24,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:39:24,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-01-24 11:39:24,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:39:24,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:39:24,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:39:24,450 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 13 states. [2018-01-24 11:39:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:24,643 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-24 11:39:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:39:24,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-24 11:39:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:24,646 INFO L225 Difference]: With dead ends: 82 [2018-01-24 11:39:24,646 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 11:39:24,646 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:39:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 11:39:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-01-24 11:39:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 11:39:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-24 11:39:24,659 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 24 [2018-01-24 11:39:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:24,659 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-24 11:39:24,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:39:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-24 11:39:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:39:24,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:24,661 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, 1] [2018-01-24 11:39:24,661 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:39:24,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1727082791, now seen corresponding path program 1 times [2018-01-24 11:39:24,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:24,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:24,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:24,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:24,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:24,678 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:24,728 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:24,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:24,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:39:24,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:39:24,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:39:24,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:39:24,730 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2018-01-24 11:39:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:24,801 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-24 11:39:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:39:24,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 11:39:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:24,802 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:39:24,802 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:39:24,802 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:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:39:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:39:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:39:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:39:24,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-24 11:39:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:24,803 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:39:24,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:39:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:39:24,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:39:24,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:39:25,095 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 56 DAG size of output 44 [2018-01-24 11:39:25,596 WARN L146 SmtUtils]: Spent 450ms on a formula simplification. DAG size of input: 64 DAG size of output 54 [2018-01-24 11:39:25,599 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,633 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:39:25,634 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,634 INFO L401 ceAbstractionStarter]: For program point test_funErr6RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,634 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 549) no Hoare annotation was computed. [2018-01-24 11:39:25,634 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 554) no Hoare annotation was computed. [2018-01-24 11:39:25,637 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,637 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-24 11:39:25,637 INFO L401 ceAbstractionStarter]: For program point test_funErr7RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,637 INFO L401 ceAbstractionStarter]: For program point test_funErr11RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point test_funErr8RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 555) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L404 ceAbstractionStarter]: At program point test_funENTRY(lines 540 555) the Hoare annotation is: true [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point L545''(lines 545 554) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-24 11:39:25,638 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point L550'''(lines 550 553) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 554) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point test_funErr10RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 554) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse1 (not (= 0 |test_fun_#in~a.offset|))) (.cse2 (not (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_2) (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| |test_fun_#in~a.base|))))))) (and (or .cse0 .cse1 .cse2 (<= test_fun_~N 1) (< 1 |test_fun_#in~N|)) (let ((.cse4 (= test_fun_~a.offset 0)) (.cse5 (= 1 (select |#valid| test_fun_~a.base))) (.cse3 (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~6_BEFORE_CALL_2))))) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 test_fun_~i~2)) .cse1 .cse2 (and .cse4 .cse5 (<= |test_fun_#in~N| test_fun_~N) .cse3 (<= 0 test_fun_~i~2)))))) [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 11:39:25,639 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 553) no Hoare annotation was computed. [2018-01-24 11:39:25,640 INFO L401 ceAbstractionStarter]: For program point test_funErr9RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,640 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,640 INFO L397 ceAbstractionStarter]: At program point L546'''(lines 546 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 (not (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_2) (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| |test_fun_#in~a.base|))))))) (and (or .cse0 .cse1 .cse2 (let ((.cse5 (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~6_BEFORE_CALL_2)))) (.cse3 (= test_fun_~a.offset 0)) (.cse4 (= 1 (select |#valid| test_fun_~a.base)))) (or (and .cse3 .cse4 (<= |test_fun_#in~N| test_fun_~N) (<= (+ (* 4 test_fun_~i~2) 4) (select |#length| test_fun_~a.base)) .cse5 (<= 0 test_fun_~i~2)) (and .cse5 .cse3 .cse4 (<= 1 test_fun_~i~2) (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| test_fun_~a.base)) (<= (+ test_fun_~i~2 1) v_main_~array_size~6_BEFORE_CALL_2))))))) (or .cse0 .cse1 .cse2 (< 1 |test_fun_#in~N|) (and (= test_fun_~i~2 0) (<= test_fun_~N 1))))) [2018-01-24 11:39:25,640 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-24 11:39:25,640 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,640 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-24 11:39:25,640 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:39:25,640 INFO L401 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-24 11:39:25,641 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-24 11:39:25,641 INFO L397 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~6))) (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= 0 main_~numbers~6.offset) (<= 1 main_~array_size~6) (= 0 |main_#t~malloc10.offset|) (= (store |#valid| |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|)) |old(#valid)|) (= 1 (select |#valid| main_~numbers~6.base)) (= .cse0 (select |#length| |main_#t~malloc10.base|)) (= .cse0 (select |#length| main_~numbers~6.base)))) [2018-01-24 11:39:25,641 INFO L401 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-24 11:39:25,641 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 556 563) no Hoare annotation was computed. [2018-01-24 11:39:25,641 INFO L401 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-24 11:39:25,641 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 556 563) no Hoare annotation was computed. [2018-01-24 11:39:25,641 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 556 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:39:25,641 INFO L401 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-24 11:39:25,642 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 556 563) no Hoare annotation was computed. [2018-01-24 11:39:25,646 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,647 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,647 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,660 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,660 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,663 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,663 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,663 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,664 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,664 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,664 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:39:25 BoogieIcfgContainer [2018-01-24 11:39:25,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:39:25,670 INFO L168 Benchmark]: Toolchain (without parser) took 4112.76 ms. Allocated memory was 306.7 MB in the beginning and 513.8 MB in the end (delta: 207.1 MB). Free memory was 266.6 MB in the beginning and 477.9 MB in the end (delta: -211.3 MB). Peak memory consumption was 137.9 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:25,671 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:39:25,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.03 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.5 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:25,672 INFO L168 Benchmark]: Boogie Preprocessor took 35.79 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:25,672 INFO L168 Benchmark]: RCFGBuilder took 278.54 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 235.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:25,673 INFO L168 Benchmark]: TraceAbstraction took 3585.70 ms. Allocated memory was 306.7 MB in the beginning and 513.8 MB in the end (delta: 207.1 MB). Free memory was 235.6 MB in the beginning and 477.9 MB in the end (delta: -242.3 MB). Peak memory consumption was 106.9 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:25,675 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.18 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.03 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.79 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 278.54 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 235.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3585.70 ms. Allocated memory was 306.7 MB in the beginning and 513.8 MB in the end (delta: 207.1 MB). Free memory was 235.6 MB in the beginning and 477.9 MB in the end (delta: -242.3 MB). Peak memory consumption was 106.9 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~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_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 * 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: 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: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-24 11:39:25,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\valid[a] == 1) || !(0 == a)) || !(\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_2 && 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a])) || N <= 1) || 1 < \old(N)) && ((((!(\valid[a] == 1) || ((((\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_2) && a == 0) && 1 == \valid[a]) && 1 <= i)) || !(0 == a)) || !(\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_2 && 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a])) || ((((a == 0 && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_2)) && 0 <= i)) - InvariantResult [Line: 546]: Loop Invariant [2018-01-24 11:39:25,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:39:25,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:25,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((!(\valid[a] == 1) || !(0 == a)) || !(\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_2 && 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a])) || (((((a == 0 && 1 == \valid[a]) && \old(N) <= N) && 4 * i + 4 <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_2)) && 0 <= i) || (((((\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_2) && a == 0) && 1 == \valid[a]) && 1 <= i) && (\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a] && i + 1 <= v_main_~array_size~6_BEFORE_CALL_2))) && ((((!(\valid[a] == 1) || !(0 == a)) || !(\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_2 && 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[a])) || 1 < \old(N)) || (i == 0 && N <= 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 13 error locations. SAFE Result, 3.5s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 179 SDtfs, 419 SDslu, 565 SDs, 0 SdLazy, 477 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred 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, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 296 HoareAnnotationTreeSize, 11 FomulaSimplifications, 49 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 559 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 163 ConstructedInterpolants, 14 QuantifiedInterpolants, 22744 SizeOfPredicates, 9 NumberOfNonLiveVariables, 177 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/array02-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-25-703.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-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-25-703.csv Received shutdown request...