java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:58:41,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:58:41,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:58:41,355 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:58:41,355 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:58:41,356 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:58:41,357 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:58:41,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:58:41,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:58:41,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:58:41,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:58:41,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:58:41,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:58:41,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:58:41,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:58:41,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:58:41,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:58:41,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:58:41,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:58:41,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:58:41,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:58:41,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:58:41,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:58:41,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:58:41,379 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:58:41,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:58:41,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:58:41,380 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:58:41,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:58:41,381 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:58:41,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:58:41,382 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:58:41,391 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:58:41,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:58:41,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:58:41,393 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:58:41,393 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:58:41,393 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:58:41,394 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:58:41,394 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:58:41,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:58:41,395 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:58:41,395 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:58:41,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:58:41,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:58:41,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:58:41,396 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:58:41,396 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:58:41,396 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:58:41,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:58:41,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:58:41,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:58:41,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:58:41,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:58:41,397 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:58:41,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:58:41,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:58:41,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:58:41,398 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:58:41,398 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:58:41,398 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:58:41,399 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:58:41,399 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:58:41,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:58:41,399 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:58:41,399 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:58:41,400 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:58:41,400 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:58:41,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:58:41,448 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:58:41,452 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:58:41,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:58:41,454 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:58:41,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-01-25 05:58:41,652 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:58:41,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:58:41,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:58:41,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:58:41,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:58:41,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a17fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41, skipping insertion in model container [2018-01-25 05:58:41,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,678 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:58:41,715 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:58:41,831 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:58:41,846 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:58:41,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41 WrapperNode [2018-01-25 05:58:41,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:58:41,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:58:41,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:58:41,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:58:41,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (1/1) ... [2018-01-25 05:58:41,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:58:41,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:58:41,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:58:41,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:58:41,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (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-25 05:58:41,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:58:41,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:58:41,931 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-25 05:58:41,932 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:58:41,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:58:41,933 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:58:42,219 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:58:42,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:58:42 BoogieIcfgContainer [2018-01-25 05:58:42,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:58:42,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:58:42,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:58:42,222 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:58:42,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:58:41" (1/3) ... [2018-01-25 05:58:42,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54261a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:58:42, skipping insertion in model container [2018-01-25 05:58:42,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:41" (2/3) ... [2018-01-25 05:58:42,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54261a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:58:42, skipping insertion in model container [2018-01-25 05:58:42,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:58:42" (3/3) ... [2018-01-25 05:58:42,226 INFO L105 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-01-25 05:58:42,233 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:58:42,239 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-01-25 05:58:42,277 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:58:42,278 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:58:42,278 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:58:42,278 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:58:42,278 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:58:42,278 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:58:42,278 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:58:42,278 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:58:42,279 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:58:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-25 05:58:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:58:42,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:42,303 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:42,304 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:42,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926480, now seen corresponding path program 1 times [2018-01-25 05:58:42,309 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:42,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:42,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:42,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:42,352 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:42,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:42,615 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-25 05:58:42,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:42,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:42,618 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:42,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:42,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:42,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:42,704 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-01-25 05:58:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:42,869 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-01-25 05:58:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:58:42,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-25 05:58:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:42,879 INFO L225 Difference]: With dead ends: 104 [2018-01-25 05:58:42,879 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 05:58:42,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 05:58:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-25 05:58:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 05:58:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-01-25 05:58:42,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 17 [2018-01-25 05:58:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:42,915 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-01-25 05:58:42,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-01-25 05:58:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:58:42,915 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:42,915 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:42,915 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926481, now seen corresponding path program 1 times [2018-01-25 05:58:42,916 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:42,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:42,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:42,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:42,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:42,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:43,039 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-25 05:58:43,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:43,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:58:43,039 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:43,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:58:43,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:58:43,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:43,042 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 5 states. [2018-01-25 05:58:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:43,148 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-01-25 05:58:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:58:43,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 05:58:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:43,152 INFO L225 Difference]: With dead ends: 76 [2018-01-25 05:58:43,152 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 05:58:43,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:58:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 05:58:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 05:58:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 05:58:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-01-25 05:58:43,167 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 17 [2018-01-25 05:58:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:43,167 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-01-25 05:58:43,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:58:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-01-25 05:58:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:58:43,168 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:43,169 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-25 05:58:43,169 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1541211425, now seen corresponding path program 1 times [2018-01-25 05:58:43,169 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:43,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:43,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,172 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:43,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:43,275 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-25 05:58:43,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:43,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:58:43,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:43,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:58:43,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:58:43,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:43,276 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 5 states. [2018-01-25 05:58:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:43,378 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-01-25 05:58:43,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:58:43,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:58:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:43,379 INFO L225 Difference]: With dead ends: 71 [2018-01-25 05:58:43,379 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 05:58:43,380 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:58:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 05:58:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 05:58:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 05:58:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-01-25 05:58:43,387 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 18 [2018-01-25 05:58:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:43,388 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-01-25 05:58:43,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:58:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-01-25 05:58:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:58:43,389 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:43,389 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:43,389 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash 532913875, now seen corresponding path program 1 times [2018-01-25 05:58:43,390 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:43,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:43,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,391 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:43,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:43,461 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-25 05:58:43,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:43,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:43,461 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:43,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:43,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:43,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:43,463 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 4 states. [2018-01-25 05:58:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:43,523 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-01-25 05:58:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:58:43,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-25 05:58:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:43,524 INFO L225 Difference]: With dead ends: 67 [2018-01-25 05:58:43,525 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:58:43,525 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:58:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-25 05:58:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 05:58:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-01-25 05:58:43,531 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 19 [2018-01-25 05:58:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:43,531 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-01-25 05:58:43,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-01-25 05:58:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:58:43,532 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:43,532 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:43,532 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash 532913876, now seen corresponding path program 1 times [2018-01-25 05:58:43,533 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:43,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:43,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:43,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:43,727 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-25 05:58:43,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:43,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:58:43,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:43,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:58:43,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:58:43,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:58:43,729 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 8 states. [2018-01-25 05:58:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:43,949 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-01-25 05:58:43,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:58:43,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:58:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:43,950 INFO L225 Difference]: With dead ends: 63 [2018-01-25 05:58:43,950 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:58:43,950 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:58:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:58:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 05:58:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 05:58:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-01-25 05:58:43,954 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 19 [2018-01-25 05:58:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:43,954 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-01-25 05:58:43,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:58:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-01-25 05:58:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:58:43,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:43,955 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:43,955 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash -659539069, now seen corresponding path program 1 times [2018-01-25 05:58:43,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:43,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:43,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:43,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:43,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:43,998 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-25 05:58:43,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:43,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:43,999 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:43,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:44,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:44,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:44,000 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2018-01-25 05:58:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:44,051 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-01-25 05:58:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:58:44,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:58:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:44,053 INFO L225 Difference]: With dead ends: 59 [2018-01-25 05:58:44,053 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:58:44,053 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-25 05:58:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:58:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 05:58:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:58:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-01-25 05:58:44,060 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 20 [2018-01-25 05:58:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:44,061 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-01-25 05:58:44,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-01-25 05:58:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:58:44,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:44,062 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:44,062 INFO L371 AbstractCegarLoop]: === Iteration 7 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash -659539068, now seen corresponding path program 1 times [2018-01-25 05:58:44,063 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:44,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:44,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:44,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:44,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:44,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:44,159 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-25 05:58:44,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:44,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:44,160 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:44,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:44,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:44,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:44,161 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 4 states. [2018-01-25 05:58:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:44,207 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-01-25 05:58:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:58:44,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:58:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:44,208 INFO L225 Difference]: With dead ends: 55 [2018-01-25 05:58:44,208 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:58:44,208 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-25 05:58:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:58:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:58:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:58:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-01-25 05:58:44,212 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 20 [2018-01-25 05:58:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:44,212 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-01-25 05:58:44,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-01-25 05:58:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:58:44,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:44,213 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:44,213 INFO L371 AbstractCegarLoop]: === Iteration 8 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:58:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1501734176, now seen corresponding path program 1 times [2018-01-25 05:58:44,213 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:44,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:44,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:44,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:44,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:44,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:44,756 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 61 DAG size of output 39 [2018-01-25 05:58:45,004 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-25 05:58:45,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:45,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:58:45,043 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:45,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:58:45,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:58:45,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:58:45,044 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 10 states. [2018-01-25 05:58:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:45,459 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-01-25 05:58:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:58:45,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-25 05:58:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:45,464 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:58:45,464 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:58:45,465 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:58:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:58:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:58:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:58:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:58:45,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-01-25 05:58:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:45,466 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:58:45,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:58:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:58:45,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:58:45,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:58:45,710 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 94 DAG size of output 93 [2018-01-25 05:58:45,715 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point test_funErr6RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point test_funErr12RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point test_funErr21RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point test_funErr20RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-25 05:58:45,716 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point test_funErr7RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point test_funErr11RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L550'''''(lines 550 557) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L554''(line 554) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point test_funErr28RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,717 INFO L401 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-25 05:58:45,718 INFO L401 ceAbstractionStarter]: For program point test_funErr8RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,718 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-25 05:58:45,718 INFO L401 ceAbstractionStarter]: For program point test_funErr14RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,718 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 559) no Hoare annotation was computed. [2018-01-25 05:58:45,718 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,718 INFO L397 ceAbstractionStarter]: At program point L550''''(lines 550 557) the Hoare annotation is: (let ((.cse2 (store |#valid| |test_fun_#t~malloc0.base| 0))) (let ((.cse1 (select .cse2 |test_fun_#t~malloc0.base|)) (.cse0 (select |#length| test_fun_~y_ref~2.base))) (and (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc3.base|)) (= (select |#valid| |test_fun_#t~malloc1.base|) 1) (= (select |old(#valid)| |test_fun_#t~malloc3.base|) 0) (= (select |#length| |test_fun_#t~malloc2.base|) .cse0) (= 0 |test_fun_#t~malloc0.offset|) (= 1 (select |#valid| |test_fun_#t~malloc3.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)) (= 4 (select |#length| |test_fun_#t~malloc0.base|)) (= (select |old(#valid)| |test_fun_#t~malloc1.base|) 0) (= 4 (select |#length| test_fun_~x_ref~2.base)) (= test_fun_~c~2.offset 0) (= 4 (select |#length| |test_fun_#t~malloc1.base|)) (= (select |old(#valid)| |test_fun_#t~malloc2.base|) 0) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc1.base|)) (= (select |old(#valid)| |test_fun_#t~malloc0.base|) .cse1) (= 0 |test_fun_#t~malloc3.offset|) (= 1 (select |#valid| test_fun_~z_ref~2.base)) (= (select |#valid| |test_fun_#t~malloc0.base|) 1) (= (select |#valid| test_fun_~y_ref~2.base) 1) (= 4 .cse0) (= test_fun_~x_ref~2.offset 0) (= 1 (select |#valid| test_fun_~c~2.base)) (= 1 (select |#valid| |test_fun_#t~malloc2.base|)) (= (select |#length| test_fun_~c~2.base) 4) (= (select |#valid| test_fun_~x_ref~2.base) 1) (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc2.base|)) (= 0 |test_fun_#t~malloc2.offset|) (= test_fun_~z_ref~2.offset 0) (= test_fun_~y_ref~2.offset 0) (= .cse2 (store (store (store (store |old(#valid)| |test_fun_#t~malloc0.base| .cse1) |test_fun_#t~malloc1.base| (select .cse2 |test_fun_#t~malloc1.base|)) |test_fun_#t~malloc3.base| (select .cse2 |test_fun_#t~malloc3.base|)) |test_fun_#t~malloc2.base| (select .cse2 |test_fun_#t~malloc2.base|))) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc2.base|)) (= 4 (select |#length| |test_fun_#t~malloc3.base|)) (= 0 |test_fun_#t~malloc1.offset|) (= (select |#length| test_fun_~z_ref~2.base) .cse0) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc3.base|))))) [2018-01-25 05:58:45,718 INFO L397 ceAbstractionStarter]: At program point test_funENTRY(lines 540 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:58:45,718 INFO L401 ceAbstractionStarter]: For program point test_funErr22RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point L551''''(lines 551 555) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point test_funErr17RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point test_funFINAL(lines 540 559) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point test_funErr25RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point test_funErr18RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,719 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point test_funErr27RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point test_funErr24RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point test_funErr19RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point test_funErr15RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point test_funErr10RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 557) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point test_funErr23RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,720 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point test_funErr16RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point test_funErr29RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point test_funErr9RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point test_funErr26RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point test_funErr13RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,721 INFO L401 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-25 05:58:45,722 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-25 05:58:45,722 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,722 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-25 05:58:45,722 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:58:45,722 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 560 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:58:45,722 INFO L401 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-25 05:58:45,722 INFO L397 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:58:45,722 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 560 562) no Hoare annotation was computed. [2018-01-25 05:58:45,722 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 560 562) no Hoare annotation was computed. [2018-01-25 05:58:45,722 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 560 562) no Hoare annotation was computed. [2018-01-25 05:58:45,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:58:45 BoogieIcfgContainer [2018-01-25 05:58:45,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:58:45,746 INFO L168 Benchmark]: Toolchain (without parser) took 4094.03 ms. Allocated memory was 307.2 MB in the beginning and 521.7 MB in the end (delta: 214.4 MB). Free memory was 267.1 MB in the beginning and 438.4 MB in the end (delta: -171.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:45,747 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:58:45,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.26 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:45,748 INFO L168 Benchmark]: Boogie Preprocessor took 30.94 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:45,748 INFO L168 Benchmark]: RCFGBuilder took 336.35 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 231.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:45,749 INFO L168 Benchmark]: TraceAbstraction took 3525.32 ms. Allocated memory was 307.2 MB in the beginning and 521.7 MB in the end (delta: 214.4 MB). Free memory was 231.0 MB in the beginning and 438.4 MB in the end (delta: -207.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:45,750 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.26 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.94 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 336.35 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 231.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3525.32 ms. Allocated memory was 307.2 MB in the beginning and 521.7 MB in the end (delta: 214.4 MB). Free memory was 231.0 MB in the beginning and 438.4 MB in the end (delta: -207.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 5.3 GB. * 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: 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: 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: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - InvariantResult [Line: 550]: Loop Invariant [2018-01-25 05:58:45,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:58:45,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((((((((((((!(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int))) && \valid[__builtin_alloca (sizeof(int))] == 1) && \old(\valid)[__builtin_alloca (sizeof(int))] == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int))] == unknown-#length-unknown[y_ref]) && 0 == __builtin_alloca (sizeof(int))) && 1 == \valid[__builtin_alloca (sizeof(int))]) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && 4 == unknown-#length-unknown[__builtin_alloca (sizeof(int))]) && \old(\valid)[__builtin_alloca (sizeof(int))] == 0) && 4 == unknown-#length-unknown[x_ref]) && c == 0) && 4 == unknown-#length-unknown[__builtin_alloca (sizeof(int))]) && \old(\valid)[__builtin_alloca (sizeof(int))] == 0) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && \old(\valid)[__builtin_alloca (sizeof(int))] == \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]) && 0 == __builtin_alloca (sizeof(int))) && 1 == \valid[z_ref]) && \valid[__builtin_alloca (sizeof(int))] == 1) && \valid[y_ref] == 1) && 4 == unknown-#length-unknown[y_ref]) && x_ref == 0) && 1 == \valid[c]) && 1 == \valid[__builtin_alloca (sizeof(int))]) && unknown-#length-unknown[c] == 4) && \valid[x_ref] == 1) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && 0 == __builtin_alloca (sizeof(int))) && z_ref == 0) && y_ref == 0) && \valid[__builtin_alloca (sizeof(int)) := 0] == \old(\valid)[__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]][__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]][__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]][__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]]) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && 4 == unknown-#length-unknown[__builtin_alloca (sizeof(int))]) && 0 == __builtin_alloca (sizeof(int))) && unknown-#length-unknown[z_ref] == unknown-#length-unknown[y_ref]) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 31 error locations. SAFE Result, 3.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 648 SDslu, 388 SDs, 0 SdLazy, 610 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 210 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 76862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-58-45-772.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-58-45-772.csv Received shutdown request...