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/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:19:56,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:19:56,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:19:56,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:19:56,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:19:56,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:19:56,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:19:56,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:19:56,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:19:56,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:19:56,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:19:56,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:19:56,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:19:56,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:19:56,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:19:56,950 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:19:56,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:19:56,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:19:56,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:19:56,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:19:56,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:19:56,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:19:56,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:19:56,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:19:56,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:19:56,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:19:56,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:19:56,964 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:19:56,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:19:56,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:19:56,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:19:56,966 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:19:56,974 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:19:56,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:19:56,975 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:19:56,975 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:19:56,976 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:19:56,976 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:19:56,976 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:19:56,976 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:19:56,976 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:19:56,976 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:19:56,977 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:19:56,977 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:19:56,977 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:19:56,977 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:19:56,977 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:19:56,977 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:19:56,977 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:19:56,978 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:19:56,978 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:19:56,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:19:56,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:19:56,978 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:19:56,978 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:19:56,978 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:19:56,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:19:56,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:19:56,979 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:19:56,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:19:56,979 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:19:56,979 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:19:56,980 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:19:56,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:19:56,980 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:19:56,980 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:19:56,981 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:19:56,981 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:19:57,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:19:57,026 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:19:57,030 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:19:57,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:19:57,031 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:19:57,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:19:57,216 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:19:57,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:19:57,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:19:57,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:19:57,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:19:57,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57, skipping insertion in model container [2018-01-25 05:19:57,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,249 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:19:57,289 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:19:57,399 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:19:57,415 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:19:57,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57 WrapperNode [2018-01-25 05:19:57,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:19:57,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:19:57,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:19:57,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:19:57,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (1/1) ... [2018-01-25 05:19:57,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:19:57,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:19:57,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:19:57,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:19:57,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (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:19:57,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:19:57,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:19:57,504 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-25 05:19:57,504 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:19:57,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:19:57,729 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:19:57,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:19:57 BoogieIcfgContainer [2018-01-25 05:19:57,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:19:57,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:19:57,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:19:57,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:19:57,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:19:57" (1/3) ... [2018-01-25 05:19:57,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7547cba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:19:57, skipping insertion in model container [2018-01-25 05:19:57,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:57" (2/3) ... [2018-01-25 05:19:57,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7547cba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:19:57, skipping insertion in model container [2018-01-25 05:19:57,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:19:57" (3/3) ... [2018-01-25 05:19:57,736 INFO L105 eAbstractionObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:19:57,742 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:19:57,748 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 05:19:57,788 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:19:57,788 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:19:57,789 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:19:57,789 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:19:57,789 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:19:57,789 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:19:57,789 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:19:57,789 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:19:57,789 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:19:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-25 05:19:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:19:57,809 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:57,809 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:57,809 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1926055157, now seen corresponding path program 1 times [2018-01-25 05:19:57,814 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:57,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:57,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:57,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:57,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:57,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:58,066 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:19:58,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:58,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:19:58,069 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:58,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:19:58,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:19:58,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:19:58,084 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 6 states. [2018-01-25 05:19:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:58,366 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-01-25 05:19:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:19:58,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-25 05:19:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:58,379 INFO L225 Difference]: With dead ends: 81 [2018-01-25 05:19:58,380 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 05:19:58,384 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:19:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 05:19:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-25 05:19:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 05:19:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-25 05:19:58,426 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2018-01-25 05:19:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:58,426 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-25 05:19:58,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:19:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-25 05:19:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:19:58,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:58,427 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:58,428 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1926055156, now seen corresponding path program 1 times [2018-01-25 05:19:58,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:58,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:58,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:58,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:58,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:58,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:58,622 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:19:58,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:58,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:19:58,623 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:58,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:19:58,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:19:58,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:19:58,625 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-01-25 05:19:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:58,882 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-25 05:19:58,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:19:58,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 05:19:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:58,887 INFO L225 Difference]: With dead ends: 65 [2018-01-25 05:19:58,887 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:19:58,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:19:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:19:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-01-25 05:19:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:19:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-25 05:19:58,897 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 15 [2018-01-25 05:19:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:58,898 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-25 05:19:58,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:19:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-25 05:19:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:19:58,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:58,899 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:19:58,899 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1643065362, now seen corresponding path program 1 times [2018-01-25 05:19:58,899 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:58,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:58,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:58,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:58,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:58,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:58,971 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:19:58,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:58,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:19:58,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:58,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:19:58,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:19:58,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:19:58,973 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 5 states. [2018-01-25 05:19:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:59,028 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-01-25 05:19:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:19:59,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:19:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:59,029 INFO L225 Difference]: With dead ends: 63 [2018-01-25 05:19:59,029 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:19:59,030 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:19:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:19:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-25 05:19:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:19:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-25 05:19:59,037 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2018-01-25 05:19:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:59,037 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-25 05:19:59,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:19:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-25 05:19:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:19:59,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:59,038 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:59,038 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:59,038 INFO L82 PathProgramCache]: Analyzing trace with hash 417458597, now seen corresponding path program 1 times [2018-01-25 05:19:59,039 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:59,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:59,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:59,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:59,040 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:59,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:59,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:59,174 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:19:59,175 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:19:59,177 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [38], [40], [45], [59], [67], [70], [74], [75], [81], [82], [83], [85] [2018-01-25 05:19:59,231 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:19:59,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:19:59,493 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:19:59,494 INFO L268 AbstractInterpreter]: Visited 21 different actions 31 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 05:19:59,504 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:19:59,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:59,505 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:19:59,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:59,515 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:19:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:59,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:19:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:59,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:19:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:59,715 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:19:59,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 14 [2018-01-25 05:19:59,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:59,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:19:59,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:19:59,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:19:59,717 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 6 states. [2018-01-25 05:19:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:59,852 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-01-25 05:19:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:19:59,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 05:19:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:59,854 INFO L225 Difference]: With dead ends: 114 [2018-01-25 05:19:59,854 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 05:19:59,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:19:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 05:19:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-01-25 05:19:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 05:19:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-25 05:19:59,862 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 24 [2018-01-25 05:19:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:59,862 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-25 05:19:59,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:19:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-25 05:19:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:19:59,863 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:59,863 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:59,864 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:59,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1576686109, now seen corresponding path program 1 times [2018-01-25 05:19:59,864 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:59,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:59,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:59,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:59,865 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:59,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:00,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:00,016 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:00,016 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:20:00,016 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [38], [40], [45], [59], [67], [72], [74], [75], [81], [82], [83], [85] [2018-01-25 05:20:00,017 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:20:00,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:20:00,165 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:20:00,165 INFO L268 AbstractInterpreter]: Visited 21 different actions 31 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 05:20:00,178 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:20:00,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:00,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:20:00,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:00,192 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:00,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:00,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:20:00,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:00,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:20:00,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:20:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:00,549 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:00,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:00,898 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:20:00,904 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:00,904 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:00,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:00,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:20:00,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:00,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:20:00,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:20:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:00,990 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:01,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:20:01,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-25 05:20:01,073 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:20:01,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:20:01,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:20:01,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:20:01,075 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 13 states. [2018-01-25 05:20:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:01,374 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-25 05:20:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:20:01,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-25 05:20:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:01,376 INFO L225 Difference]: With dead ends: 82 [2018-01-25 05:20:01,377 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 05:20:01,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:20:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 05:20:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-01-25 05:20:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 05:20:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-25 05:20:01,389 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 24 [2018-01-25 05:20:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:01,389 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-25 05:20:01,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:20:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-25 05:20:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:20:01,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:01,391 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:01,391 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:20:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1727082791, now seen corresponding path program 1 times [2018-01-25 05:20:01,391 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:01,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:01,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:01,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:01,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:01,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:20:01,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:01,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:20:01,460 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:01,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:20:01,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:20:01,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:20:01,461 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2018-01-25 05:20:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:01,537 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-25 05:20:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:20:01,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 05:20:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:01,538 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:20:01,538 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:20:01,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:20:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:20:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:20:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:20:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:20:01,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-25 05:20:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:01,539 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:20:01,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:20:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:20:01,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:20:01,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:20:01,924 WARN L146 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 56 DAG size of output 44 [2018-01-25 05:20:02,114 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 64 DAG size of output 54 [2018-01-25 05:20:02,117 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,117 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:20:02,117 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,117 INFO L401 ceAbstractionStarter]: For program point test_funErr6RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,117 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 549) no Hoare annotation was computed. [2018-01-25 05:20:02,117 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 554) no Hoare annotation was computed. [2018-01-25 05:20:02,117 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,117 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point test_funErr7RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point test_funErr11RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point test_funErr8RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 555) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L404 ceAbstractionStarter]: At program point test_funENTRY(lines 540 555) the Hoare annotation is: true [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point L545''(lines 545 554) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,118 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point L550'''(lines 550 553) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 554) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point test_funErr10RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,119 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 554) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse1 (not (= 0 |test_fun_#in~a.offset|))) (.cse2 (not (exists ((v_main_~array_size~6_BEFORE_CALL_4 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_4) (= (* 4 v_main_~array_size~6_BEFORE_CALL_4) (select |#length| |test_fun_#in~a.base|))))))) (and (or .cse0 .cse1 .cse2 (<= test_fun_~N 1) (< 1 |test_fun_#in~N|)) (let ((.cse3 (= test_fun_~a.offset 0)) (.cse4 (= 1 (select |#valid| test_fun_~a.base))) (.cse5 (exists ((v_main_~array_size~6_BEFORE_CALL_4 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_4) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~6_BEFORE_CALL_4))))) (or .cse0 .cse1 (and .cse3 .cse4 (<= |test_fun_#in~N| test_fun_~N) .cse5 (<= 0 test_fun_~i~2)) .cse2 (and .cse3 .cse4 (<= 1 test_fun_~i~2) .cse5))))) [2018-01-25 05:20:02,119 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 553) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L401 ceAbstractionStarter]: For program point test_funErr9RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L397 ceAbstractionStarter]: At program point L546'''(lines 546 549) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse1 (not (= 0 |test_fun_#in~a.offset|))) (.cse2 (not (exists ((v_main_~array_size~6_BEFORE_CALL_4 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_4) (= (* 4 v_main_~array_size~6_BEFORE_CALL_4) (select |#length| |test_fun_#in~a.base|))))))) (and (or .cse0 .cse1 .cse2 (< 1 |test_fun_#in~N|) (and (= test_fun_~i~2 0) (<= test_fun_~N 1))) (or .cse0 .cse1 (let ((.cse3 (= test_fun_~a.offset 0)) (.cse4 (= 1 (select |#valid| test_fun_~a.base))) (.cse5 (exists ((v_main_~array_size~6_BEFORE_CALL_4 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_4) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~6_BEFORE_CALL_4))))) (or (and .cse3 .cse4 (<= |test_fun_#in~N| test_fun_~N) (<= (+ (* 4 test_fun_~i~2) 4) (select |#length| test_fun_~a.base)) .cse5 (<= 0 test_fun_~i~2)) (and (exists ((v_main_~array_size~6_BEFORE_CALL_4 Int)) (and (<= (+ test_fun_~i~2 1) v_main_~array_size~6_BEFORE_CALL_4) (= (* 4 v_main_~array_size~6_BEFORE_CALL_4) (select |#length| test_fun_~a.base)))) .cse3 .cse4 (<= 1 test_fun_~i~2) .cse5))) .cse2))) [2018-01-25 05:20:02,120 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-25 05:20:02,120 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-25 05:20:02,120 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L401 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-25 05:20:02,120 INFO L397 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~6))) (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= 0 main_~numbers~6.offset) (<= 1 main_~array_size~6) (= 0 |main_#t~malloc10.offset|) (= (store |#valid| |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|)) |old(#valid)|) (= 1 (select |#valid| main_~numbers~6.base)) (= .cse0 (select |#length| |main_#t~malloc10.base|)) (= .cse0 (select |#length| main_~numbers~6.base)))) [2018-01-25 05:20:02,121 INFO L401 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-25 05:20:02,121 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 556 563) no Hoare annotation was computed. [2018-01-25 05:20:02,121 INFO L401 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-25 05:20:02,121 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 556 563) no Hoare annotation was computed. [2018-01-25 05:20:02,121 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 556 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:20:02,121 INFO L401 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-25 05:20:02,121 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 556 563) no Hoare annotation was computed. [2018-01-25 05:20:02,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,137 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,137 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,148 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,148 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:20:02 BoogieIcfgContainer [2018-01-25 05:20:02,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:20:02,158 INFO L168 Benchmark]: Toolchain (without parser) took 4941.52 ms. Allocated memory was 306.7 MB in the beginning and 520.1 MB in the end (delta: 213.4 MB). Free memory was 266.8 MB in the beginning and 346.4 MB in the end (delta: -79.6 MB). Peak memory consumption was 133.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:02,159 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:20:02,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.28 ms. Allocated memory is still 306.7 MB. Free memory was 265.8 MB in the beginning and 255.6 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:20:02,160 INFO L168 Benchmark]: Boogie Preprocessor took 35.27 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.7 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:20:02,160 INFO L168 Benchmark]: RCFGBuilder took 272.17 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 236.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:02,161 INFO L168 Benchmark]: TraceAbstraction took 4426.79 ms. Allocated memory was 306.7 MB in the beginning and 520.1 MB in the end (delta: 213.4 MB). Free memory was 236.1 MB in the beginning and 346.4 MB in the end (delta: -110.3 MB). Peak memory consumption was 103.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:02,162 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.13 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.28 ms. Allocated memory is still 306.7 MB. Free memory was 265.8 MB in the beginning and 255.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.27 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 272.17 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 236.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4426.79 ms. Allocated memory was 306.7 MB in the beginning and 520.1 MB in the end (delta: 213.4 MB). Free memory was 236.1 MB in the beginning and 346.4 MB in the end (delta: -110.3 MB). Peak memory consumption was 103.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 190 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.133378 RENAME_VARIABLES(MILLISECONDS) : 0.493255 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.078002 PROJECTAWAY(MILLISECONDS) : 0.312977 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.138554 DISJOIN(MILLISECONDS) : 2.310431 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.531736 ADD_EQUALITY(MILLISECONDS) : 0.134312 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.028979 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 74 #PROJECTAWAY : 65 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 71 #ADD_EQUALITY : 43 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 184 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 44 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.825401 RENAME_VARIABLES(MILLISECONDS) : 0.221249 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.786893 PROJECTAWAY(MILLISECONDS) : 0.225927 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.103947 DISJOIN(MILLISECONDS) : 0.419948 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.245238 ADD_EQUALITY(MILLISECONDS) : 0.030424 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014337 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 74 #PROJECTAWAY : 65 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 71 #ADD_EQUALITY : 44 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-25 05:20:02,172 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,172 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\valid[a] == 1) || !(0 == a)) || !(\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_4 && 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a])) || N <= 1) || 1 < \old(N)) && ((((!(\valid[a] == 1) || !(0 == a)) || ((((a == 0 && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_4)) && 0 <= i)) || !(\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_4 && 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a])) || (((a == 0 && 1 == \valid[a]) && 1 <= i) && (\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_4))) - InvariantResult [Line: 546]: Loop Invariant [2018-01-25 05:20:02,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:02,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:02,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\valid[a] == 1) || !(0 == a)) || !(\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_4 && 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a])) || 1 < \old(N)) || (i == 0 && N <= 1)) && (((!(\valid[a] == 1) || !(0 == a)) || (((((a == 0 && 1 == \valid[a]) && \old(N) <= N) && 4 * i + 4 <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_4)) && 0 <= i) || (((((\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: i + 1 <= v_main_~array_size~6_BEFORE_CALL_4 && 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a]) && a == 0) && 1 == \valid[a]) && 1 <= i) && (\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_4))) || !(\exists v_main_~array_size~6_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_4 && 4 * v_main_~array_size~6_BEFORE_CALL_4 == unknown-#length-unknown[a])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 13 error locations. SAFE Result, 4.3s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 343 SDslu, 498 SDs, 0 SdLazy, 441 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 126 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 296 HoareAnnotationTreeSize, 11 FomulaSimplifications, 49 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 559 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 255 ConstructedInterpolants, 52 QuantifiedInterpolants, 56163 SizeOfPredicates, 19 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 18/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-20-02-197.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-20-02-197.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-20-02-197.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-20-02-197.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-20-02-197.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-20-02-197.csv Received shutdown request...