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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:44:07,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:44:07,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:44:07,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:44:07,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:44:07,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:44:07,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:44:07,991 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:44:07,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:44:07,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:44:07,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:44:07,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:44:07,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:44:07,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:44:07,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:44:08,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:44:08,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:44:08,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:44:08,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:44:08,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:44:08,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:44:08,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:44:08,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:44:08,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:44:08,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:44:08,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:44:08,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:44:08,015 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:44:08,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:44:08,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:44:08,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:44:08,017 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:44:08,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:44:08,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:44:08,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:44:08,027 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:44:08,027 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:44:08,027 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:44:08,027 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:44:08,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:44:08,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:44:08,028 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:44:08,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:44:08,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:44:08,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:44:08,029 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:44:08,029 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:44:08,029 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:44:08,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:44:08,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:44:08,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:44:08,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:44:08,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:44:08,030 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:44:08,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:44:08,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:08,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:44:08,031 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:44:08,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:44:08,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:44:08,031 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:44:08,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:44:08,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:44:08,031 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:44:08,032 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:44:08,032 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:44:08,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:44:08,078 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:44:08,082 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:44:08,083 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:44:08,083 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:44:08,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i [2018-01-24 12:44:08,223 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:44:08,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:44:08,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:08,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:44:08,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:44:08,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb77e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08, skipping insertion in model container [2018-01-24 12:44:08,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,255 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:08,296 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:08,420 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:08,440 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:08,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08 WrapperNode [2018-01-24 12:44:08,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:08,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:44:08,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:44:08,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:44:08,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... [2018-01-24 12:44:08,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:44:08,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:44:08,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:44:08,490 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:44:08,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:08,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:44:08,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:44:08,539 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-01-24 12:44:08,540 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-24 12:44:08,540 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:44:08,540 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:44:08,540 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:44:08,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:44:08,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:44:08,540 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:44:08,540 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:44:08,541 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:44:08,541 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:44:08,541 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-01-24 12:44:08,541 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-24 12:44:08,541 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:44:08,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:44:08,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:44:08,811 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:44:08,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:08 BoogieIcfgContainer [2018-01-24 12:44:08,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:44:08,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:44:08,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:44:08,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:44:08,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:44:08" (1/3) ... [2018-01-24 12:44:08,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da81185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:08, skipping insertion in model container [2018-01-24 12:44:08,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:08" (2/3) ... [2018-01-24 12:44:08,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da81185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:08, skipping insertion in model container [2018-01-24 12:44:08,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:08" (3/3) ... [2018-01-24 12:44:08,817 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe_false-valid-deref.i [2018-01-24 12:44:08,823 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:44:08,828 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 12:44:08,871 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:44:08,871 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:44:08,871 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:44:08,871 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:44:08,872 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:44:08,872 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:44:08,872 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:44:08,872 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:44:08,873 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:44:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-24 12:44:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:44:08,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:08,899 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:08,899 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:44:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1167838739, now seen corresponding path program 1 times [2018-01-24 12:44:08,904 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:08,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:08,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:08,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:08,945 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:08,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:09,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:09,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:44:09,086 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:09,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:44:09,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:44:09,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:44:09,101 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-01-24 12:44:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:09,339 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-01-24 12:44:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:44:09,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-24 12:44:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:09,353 INFO L225 Difference]: With dead ends: 109 [2018-01-24 12:44:09,353 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 12:44:09,357 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 12:44:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 12:44:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:44:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-24 12:44:09,403 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 11 [2018-01-24 12:44:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:09,403 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-24 12:44:09,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:44:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-24 12:44:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:44:09,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:09,404 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:09,405 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:44:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1167838738, now seen corresponding path program 1 times [2018-01-24 12:44:09,405 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:09,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:09,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:09,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:09,407 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:09,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:09,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:09,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:44:09,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:09,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:44:09,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:44:09,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:09,522 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-01-24 12:44:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:09,577 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-24 12:44:09,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:09,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-24 12:44:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:09,579 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:44:09,579 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:44:09,580 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:44:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:44:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:44:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:44:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-24 12:44:09,587 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 11 [2018-01-24 12:44:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:09,588 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-24 12:44:09,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:44:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-24 12:44:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:44:09,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:09,589 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:09,589 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:44:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1764023599, now seen corresponding path program 1 times [2018-01-24 12:44:09,589 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:09,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:09,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:09,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:09,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:09,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:09,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:09,869 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-24 12:44:09,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:09,878 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:09,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:10,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-01-24 12:44:10,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:10,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:44:10,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-01-24 12:44:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:10,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:10,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:10,388 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:44:10,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:10,392 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:10,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:10,447 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 6 treesize of output 5 [2018-01-24 12:44:10,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:10,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:10,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:44:10,498 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |build_nondet_String_#t~malloc1.base| 1))) is different from true [2018-01-24 12:44:10,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-01-24 12:44:10,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:10,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:44:10,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 12:44:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-01-24 12:44:10,540 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:10,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:44:10,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10, 10, 9] total 19 [2018-01-24 12:44:10,671 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:44:10,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:44:10,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:44:10,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=271, Unknown=7, NotChecked=34, Total=380 [2018-01-24 12:44:10,672 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 15 states. [2018-01-24 12:44:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:10,951 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-24 12:44:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:44:10,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-24 12:44:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:10,953 INFO L225 Difference]: With dead ends: 63 [2018-01-24 12:44:10,953 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:44:10,954 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 19 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=499, Unknown=7, NotChecked=48, Total=702 [2018-01-24 12:44:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:44:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 12:44:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 12:44:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-01-24 12:44:10,962 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 29 [2018-01-24 12:44:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:10,964 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-01-24 12:44:10,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:44:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-01-24 12:44:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:44:10,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:10,965 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:10,965 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:44:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1764023598, now seen corresponding path program 1 times [2018-01-24 12:44:10,965 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:10,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:10,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:10,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:10,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:10,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:11,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:11,186 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:44:11,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:11,192 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:11,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:11,238 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 6 treesize of output 5 [2018-01-24 12:44:11,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:11,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:11,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:44:11,513 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int)) (= (store |c_old(#length)| |build_nondet_String_#t~malloc1.base| 1) |c_#length|)) is different from true [2018-01-24 12:44:11,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-01-24 12:44:11,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:11,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:44:11,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-01-24 12:44:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-24 12:44:11,594 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:11,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:11,988 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:44:11,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:11,991 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:12,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:12,041 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 6 treesize of output 5 [2018-01-24 12:44:12,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:12,047 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 6 treesize of output 5 [2018-01-24 12:44:12,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:12,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:12,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:44:12,268 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int) (build_nondet_String_~length~4 Int)) (and (= (store |c_old(#length)| |build_nondet_String_#t~malloc1.base| build_nondet_String_~length~4) |c_#length|) (= 0 (select |c_old(#valid)| |build_nondet_String_#t~malloc1.base|)))) is different from true [2018-01-24 12:44:12,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:44:12,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 12:44:12,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:12,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:44:12,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:44:12,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:44:12,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:12,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:12,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-01-24 12:44:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-01-24 12:44:12,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:12,439 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 12:44:13,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-24 12:44:13,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:13,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 12:44:13,711 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:44:13,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:13,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 12:44:13,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:13,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:13,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:13,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2018-01-24 12:44:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:13,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:44:13,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13, 12, 12] total 50 [2018-01-24 12:44:13,726 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:44:13,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 12:44:13,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 12:44:13,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2187, Unknown=3, NotChecked=190, Total=2550 [2018-01-24 12:44:13,727 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 28 states. [2018-01-24 12:44:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:15,165 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-01-24 12:44:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-24 12:44:15,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2018-01-24 12:44:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:15,170 INFO L225 Difference]: With dead ends: 155 [2018-01-24 12:44:15,170 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 12:44:15,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=427, Invalid=4000, Unknown=3, NotChecked=262, Total=4692 [2018-01-24 12:44:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 12:44:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 60. [2018-01-24 12:44:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:44:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-24 12:44:15,194 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 29 [2018-01-24 12:44:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:15,194 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-24 12:44:15,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 12:44:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-24 12:44:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:44:15,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:15,201 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:15,201 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:44:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash -464489331, now seen corresponding path program 1 times [2018-01-24 12:44:15,202 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:15,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:15,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:15,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:15,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:44:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:44:15,258 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 12:44:15,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:44:15 BoogieIcfgContainer [2018-01-24 12:44:15,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:44:15,293 INFO L168 Benchmark]: Toolchain (without parser) took 7068.91 ms. Allocated memory was 308.3 MB in the beginning and 546.3 MB in the end (delta: 238.0 MB). Free memory was 268.2 MB in the beginning and 510.1 MB in the end (delta: -241.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:44:15,293 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:44:15,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.04 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:15,294 INFO L168 Benchmark]: Boogie Preprocessor took 41.77 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:15,294 INFO L168 Benchmark]: RCFGBuilder took 322.94 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 234.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:15,294 INFO L168 Benchmark]: TraceAbstraction took 6479.28 ms. Allocated memory was 308.3 MB in the beginning and 546.3 MB in the end (delta: 238.0 MB). Free memory was 234.0 MB in the beginning and 510.1 MB in the end (delta: -276.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:44:15,296 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.12 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.04 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.77 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 322.94 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 234.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6479.28 ms. Allocated memory was 308.3 MB in the beginning and 546.3 MB in the end (delta: 238.0 MB). Free memory was 234.0 MB in the beginning and 510.1 MB in the end (delta: -276.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L565] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); [L542] COND TRUE length < 1 [L543] length = 1 VAL [length=1] [L545] EXPR, FCALL malloc(length * sizeof(char)) VAL [length=1, malloc(length * sizeof(char))={3:0}] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L546] FCALL nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L547] RET return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L565] EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L565] char* s1 = build_nondet_String(); [L566] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); [L542] COND TRUE length < 1 [L543] length = 1 VAL [length=1] [L545] EXPR, FCALL malloc(length * sizeof(char)) VAL [length=1, malloc(length * sizeof(char))={5:0}] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={5:0}, nondetString={5:0}] [L546] FCALL nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={5:0}, nondetString={5:0}] [L547] RET return nondetString; VAL [\result={5:0}, length=1, malloc(length * sizeof(char))={5:0}, nondetString={5:0}] [L566] EXPR build_nondet_String() VAL [build_nondet_String()={5:0}, s1={3:0}] [L566] char* s2 = build_nondet_String(); [L567] CALL cstrpbrk(s1,s2) VAL [s1={3:0}, s2={5:0}] [L551] const char *sc1; [L552] const char *s; [L553] int c; [L554] sc1 = s1 VAL [s1={3:0}, s1={3:0}, s2={5:0}, s2={5:0}, sc1={3:0}] [L554] EXPR, FCALL \read(*sc1) VAL [\read(*sc1)=0, s1={3:0}, s1={3:0}, s2={5:0}, s2={5:0}, sc1={3:0}] [L554] COND FALSE !(*sc1 != '\0') [L562] RET return 0; VAL [\result={0:0}, s1={3:0}, s1={3:0}, s2={5:0}, s2={5:0}, sc1={3:0}] [L567] cstrpbrk(s1,s2) VAL [cstrpbrk(s1,s2)={0:0}, s1={3:0}, s2={5:0}] [L567] FCALL cstrpbrk(s1,s2) VAL [cstrpbrk(s1,s2)={0:0}, s1={3:0}, s2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 65 locations, 19 error locations. UNSAFE Result, 6.4s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 199 SDtfs, 620 SDslu, 510 SDs, 0 SdLazy, 1287 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 168 SyntacticMatches, 23 SemanticMatches, 99 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 95 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 300 ConstructedInterpolants, 56 QuantifiedInterpolants, 65396 SizeOfPredicates, 39 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 32/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-44-15-304.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-44-15-304.csv Received shutdown request...