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_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 20:58:22,462 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 20:58:22,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 20:58:22,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 20:58:22,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 20:58:22,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 20:58:22,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 20:58:22,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 20:58:22,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 20:58:22,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 20:58:22,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 20:58:22,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 20:58:22,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 20:58:22,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 20:58:22,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 20:58:22,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 20:58:22,498 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 20:58:22,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 20:58:22,501 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 20:58:22,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 20:58:22,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 20:58:22,505 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 20:58:22,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 20:58:22,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 20:58:22,507 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 20:58:22,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 20:58:22,508 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 20:58:22,508 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 20:58:22,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 20:58:22,509 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 20:58:22,509 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 20:58:22,509 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_SS.epf [2018-01-28 20:58:22,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 20:58:22,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 20:58:22,519 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 20:58:22,519 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 20:58:22,519 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 20:58:22,519 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 20:58:22,519 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 20:58:22,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 20:58:22,520 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 20:58:22,520 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 20:58:22,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 20:58:22,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 20:58:22,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 20:58:22,521 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 20:58:22,521 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 20:58:22,521 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 20:58:22,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 20:58:22,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 20:58:22,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 20:58:22,521 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 20:58:22,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 20:58:22,522 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 20:58:22,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 20:58:22,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 20:58:22,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 20:58:22,523 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 20:58:22,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 20:58:22,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 20:58:22,523 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 20:58:22,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 20:58:22,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 20:58:22,523 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 20:58:22,524 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 20:58:22,524 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 20:58:22,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 20:58:22,598 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 20:58:22,602 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 20:58:22,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 20:58:22,604 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 20:58:22,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-01-28 20:58:22,790 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 20:58:22,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 20:58:22,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 20:58:22,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 20:58:22,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 20:58:22,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:22" (1/1) ... [2018-01-28 20:58:22,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba5b41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:22, skipping insertion in model container [2018-01-28 20:58:22,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:22" (1/1) ... [2018-01-28 20:58:22,820 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:58:22,859 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:58:22,977 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:58:22,997 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:58:23,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23 WrapperNode [2018-01-28 20:58:23,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 20:58:23,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 20:58:23,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 20:58:23,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 20:58:23,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (1/1) ... [2018-01-28 20:58:23,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (1/1) ... [2018-01-28 20:58:23,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (1/1) ... [2018-01-28 20:58:23,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (1/1) ... [2018-01-28 20:58:23,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (1/1) ... [2018-01-28 20:58:23,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (1/1) ... [2018-01-28 20:58:23,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (1/1) ... [2018-01-28 20:58:23,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 20:58:23,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 20:58:23,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 20:58:23,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 20:58:23,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (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-28 20:58:23,160 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 20:58:23,160 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 20:58:23,160 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-28 20:58:23,160 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-28 20:58:23,161 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 20:58:23,162 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 20:58:23,162 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 20:58:23,437 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 20:58:23,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:23 BoogieIcfgContainer [2018-01-28 20:58:23,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 20:58:23,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 20:58:23,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 20:58:23,441 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 20:58:23,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 08:58:22" (1/3) ... [2018-01-28 20:58:23,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291b1f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:23, skipping insertion in model container [2018-01-28 20:58:23,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:23" (2/3) ... [2018-01-28 20:58:23,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291b1f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:23, skipping insertion in model container [2018-01-28 20:58:23,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:23" (3/3) ... [2018-01-28 20:58:23,444 INFO L107 eAbstractionObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-01-28 20:58:23,451 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 20:58:23,457 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 20:58:23,501 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 20:58:23,501 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 20:58:23,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 20:58:23,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 20:58:23,501 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 20:58:23,501 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 20:58:23,502 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 20:58:23,502 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 20:58:23,503 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 20:58:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-28 20:58:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 20:58:23,530 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:23,531 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:23,531 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-28 20:58:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1044361509, now seen corresponding path program 1 times [2018-01-28 20:58:23,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:23,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:23,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:23,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:23,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:23,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:23,838 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-28 20:58:23,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:23,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 20:58:23,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:58:23,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:58:23,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:58:23,856 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 6 states. [2018-01-28 20:58:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:24,269 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-01-28 20:58:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 20:58:24,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-28 20:58:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:24,282 INFO L225 Difference]: With dead ends: 118 [2018-01-28 20:58:24,282 INFO L226 Difference]: Without dead ends: 62 [2018-01-28 20:58:24,285 INFO L533 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-28 20:58:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-28 20:58:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-28 20:58:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-28 20:58:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-28 20:58:24,323 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 22 [2018-01-28 20:58:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:24,324 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-28 20:58:24,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:58:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-28 20:58:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 20:58:24,325 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:24,325 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:24,325 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-28 20:58:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1044361510, now seen corresponding path program 1 times [2018-01-28 20:58:24,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:24,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:24,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:24,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:24,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:24,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:24,507 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-28 20:58:24,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:24,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 20:58:24,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 20:58:24,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 20:58:24,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 20:58:24,510 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 8 states. [2018-01-28 20:58:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:24,719 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-01-28 20:58:24,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 20:58:24,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-28 20:58:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:24,722 INFO L225 Difference]: With dead ends: 100 [2018-01-28 20:58:24,723 INFO L226 Difference]: Without dead ends: 93 [2018-01-28 20:58:24,724 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-28 20:58:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-28 20:58:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-01-28 20:58:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 20:58:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-01-28 20:58:24,732 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 22 [2018-01-28 20:58:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:24,733 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-01-28 20:58:24,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 20:58:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-01-28 20:58:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 20:58:24,733 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:24,733 INFO L330 BasicCegarLoop]: trace histogram [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-28 20:58:24,734 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-28 20:58:24,734 INFO L82 PathProgramCache]: Analyzing trace with hash -163857302, now seen corresponding path program 1 times [2018-01-28 20:58:24,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:24,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:24,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:24,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:24,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:24,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:24,786 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-28 20:58:24,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:24,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 20:58:24,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:58:24,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:58:24,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:58:24,787 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 6 states. [2018-01-28 20:58:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:24,882 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-28 20:58:24,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 20:58:24,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-28 20:58:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:24,884 INFO L225 Difference]: With dead ends: 97 [2018-01-28 20:58:24,884 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 20:58:24,885 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 20:58:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 20:58:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-01-28 20:58:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 20:58:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-28 20:58:24,895 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 25 [2018-01-28 20:58:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:24,896 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-28 20:58:24,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:58:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-28 20:58:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 20:58:24,898 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:24,898 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:24,898 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-28 20:58:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash -478108348, now seen corresponding path program 1 times [2018-01-28 20:58:24,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:24,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:24,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:24,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:24,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:24,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:25,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:25,119 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-28 20:58:25,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:25,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:25,190 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-28 20:58:25,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:25,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:25,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:25,685 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-28 20:58:25,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:25,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-28 20:58:25,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 20:58:25,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 20:58:25,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=257, Unknown=1, NotChecked=0, Total=306 [2018-01-28 20:58:25,715 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 18 states. [2018-01-28 20:58:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:26,520 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-01-28 20:58:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 20:58:26,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-01-28 20:58:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:26,522 INFO L225 Difference]: With dead ends: 92 [2018-01-28 20:58:26,522 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 20:58:26,523 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=581, Unknown=1, NotChecked=0, Total=756 [2018-01-28 20:58:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 20:58:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-01-28 20:58:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-28 20:58:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-28 20:58:26,531 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 37 [2018-01-28 20:58:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:26,532 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-28 20:58:26,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 20:58:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-28 20:58:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 20:58:26,533 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:26,534 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:26,534 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-28 20:58:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1208751220, now seen corresponding path program 1 times [2018-01-28 20:58:26,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:26,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:26,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:26,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:26,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:26,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:26,603 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-28 20:58:26,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:26,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 20:58:26,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 20:58:26,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 20:58:26,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 20:58:26,605 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-01-28 20:58:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:26,673 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-28 20:58:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 20:58:26,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-28 20:58:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:26,674 INFO L225 Difference]: With dead ends: 57 [2018-01-28 20:58:26,674 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 20:58:26,675 INFO L533 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-28 20:58:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 20:58:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 20:58:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 20:58:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 20:58:26,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-28 20:58:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:26,676 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 20:58:26,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 20:58:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 20:58:26,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 20:58:26,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 20:58:27,210 WARN L146 SmtUtils]: Spent 413ms on a formula simplification. DAG size of input: 51 DAG size of output 46 [2018-01-28 20:58:27,213 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,213 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,213 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 20:58:27,213 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point test_funErr6RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point test_funErr12RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 557) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-28 20:58:27,214 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point test_funErr7RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point test_funErr11RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point test_funErr8RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point test_funEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point L551'''''(lines 551 554) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L402 ceAbstractionStarter]: At program point test_funENTRY(lines 540 557) the Hoare annotation is: true [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point L544''''''(lines 544 556) no Hoare annotation was computed. [2018-01-28 20:58:27,215 INFO L399 ceAbstractionStarter]: For program point L551''''(line 551) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L551''''''(lines 551 554) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L553''''(line 553) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L544'(lines 544 556) no Hoare annotation was computed. [2018-01-28 20:58:27,216 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point test_funErr10RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 554) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point L553'''(line 553) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point test_funErr9RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-28 20:58:27,217 INFO L395 ceAbstractionStarter]: At program point L544'''''(lines 544 556) the Hoare annotation is: (let ((.cse4 (select |#length| test_fun_~a.base))) (let ((.cse0 (<= 4 .cse4)) (.cse1 (= test_fun_~a.offset 0)) (.cse2 (= 1 (select |#valid| test_fun_~a.base))) (.cse3 (<= |test_fun_#in~N| test_fun_~N))) (or (and .cse0 .cse1 (exists ((v_main_~array_size~7_BEFORE_CALL_1 Int)) (and (<= test_fun_~N v_main_~array_size~7_BEFORE_CALL_1) (= (* 4 v_main_~array_size~7_BEFORE_CALL_1) (select |#length| test_fun_~a.base)))) .cse2 .cse3 (<= 1 test_fun_~i~2)) (not (= (select |#valid| |test_fun_#in~a.base|) 1)) (not (= 0 |test_fun_#in~a.offset|)) (and .cse0 .cse1 (= 0 test_fun_~i~2) .cse2 .cse3 (exists ((v_main_~array_size~7_BEFORE_CALL_1 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~7_BEFORE_CALL_1) (= (* 4 v_main_~array_size~7_BEFORE_CALL_1) (select |#length| test_fun_~a.base)))) (<= (* 4 test_fun_~N) .cse4)) (not (exists ((v_main_~array_size~7_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~7_BEFORE_CALL_1) (select |#length| |test_fun_#in~a.base|)) (<= |test_fun_#in~N| v_main_~array_size~7_BEFORE_CALL_1)))) (< (select |#length| |test_fun_#in~a.base|) 4)))) [2018-01-28 20:58:27,217 INFO L399 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point test_funErr13RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point L560(lines 560 562) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L395 ceAbstractionStarter]: At program point L564(line 564) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~7))) (and (= 0 |main_#t~malloc9.offset|) (= .cse0 (select |#length| main_~numbers~7.base)) (= 0 main_~numbers~7.offset) (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (<= 1 main_~array_size~7) (= |old(#valid)| (store |#valid| |main_#t~malloc9.base| (select (store |#valid| |main_#t~malloc9.base| 0) |main_#t~malloc9.base|))) (= 1 (select |#valid| main_~numbers~7.base)))) [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-28 20:58:27,218 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-28 20:58:27,219 INFO L399 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-28 20:58:27,219 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 558 565) no Hoare annotation was computed. [2018-01-28 20:58:27,219 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-28 20:58:27,219 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 558 565) no Hoare annotation was computed. [2018-01-28 20:58:27,219 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 558 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 20:58:27,219 INFO L399 ceAbstractionStarter]: For program point L560''(lines 560 562) no Hoare annotation was computed. [2018-01-28 20:58:27,219 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-28 20:58:27,219 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 558 565) no Hoare annotation was computed. [2018-01-28 20:58:27,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,226 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:58:27 BoogieIcfgContainer [2018-01-28 20:58:27,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 20:58:27,243 INFO L168 Benchmark]: Toolchain (without parser) took 4452.34 ms. Allocated memory was 305.7 MB in the beginning and 497.0 MB in the end (delta: 191.4 MB). Free memory was 264.7 MB in the beginning and 447.9 MB in the end (delta: -183.2 MB). Peak memory consumption was 129.5 MB. Max. memory is 5.3 GB. [2018-01-28 20:58:27,244 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 20:58:27,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.50 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 20:58:27,245 INFO L168 Benchmark]: Boogie Preprocessor took 36.41 ms. Allocated memory is still 305.7 MB. Free memory was 254.7 MB in the beginning and 252.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-28 20:58:27,245 INFO L168 Benchmark]: RCFGBuilder took 395.26 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 232.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-28 20:58:27,245 INFO L168 Benchmark]: TraceAbstraction took 3803.99 ms. Allocated memory was 305.7 MB in the beginning and 497.0 MB in the end (delta: 191.4 MB). Free memory was 232.1 MB in the beginning and 447.9 MB in the end (delta: -215.9 MB). Peak memory consumption was 96.9 MB. Max. memory is 5.3 GB. [2018-01-28 20:58:27,247 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.15 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.50 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.41 ms. Allocated memory is still 305.7 MB. Free memory was 254.7 MB in the beginning and 252.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 395.26 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 232.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3803.99 ms. Allocated memory was 305.7 MB in the beginning and 497.0 MB in the end (delta: 191.4 MB). Free memory was 232.1 MB in the beginning and 447.9 MB in the end (delta: -215.9 MB). Peak memory consumption was 96.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~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,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 * 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: 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: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-28 20:58:27,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 20:58:27,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 20:58:27,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((4 <= unknown-#length-unknown[a] && a == 0) && (\exists v_main_~array_size~7_BEFORE_CALL_1 : int :: N <= v_main_~array_size~7_BEFORE_CALL_1 && 4 * v_main_~array_size~7_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 1 == \valid[a]) && \old(N) <= N) && 1 <= i) || !(\valid[a] == 1)) || !(0 == a)) || ((((((4 <= unknown-#length-unknown[a] && a == 0) && 0 == i) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~7_BEFORE_CALL_1 : int :: \old(N) <= v_main_~array_size~7_BEFORE_CALL_1 && 4 * v_main_~array_size~7_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 4 * N <= unknown-#length-unknown[a])) || !(\exists v_main_~array_size~7_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~7_BEFORE_CALL_1 == unknown-#length-unknown[a] && \old(N) <= v_main_~array_size~7_BEFORE_CALL_1)) || unknown-#length-unknown[a] < 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 72 locations, 15 error locations. SAFE Result, 3.7s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 947 SDslu, 719 SDs, 0 SdLazy, 468 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=2, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 9 NumberOfFragments, 155 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 177 ConstructedInterpolants, 24 QuantifiedInterpolants, 38667 SizeOfPredicates, 8 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 4/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/array03-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_20-58-27-267.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_20-58-27-267.csv Received shutdown request...