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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 11:04:14,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 11:04:14,564 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 11:04:14,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 11:04:14,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 11:04:14,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 11:04:14,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 11:04:14,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 11:04:14,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 11:04:14,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 11:04:14,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 11:04:14,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 11:04:14,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 11:04:14,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 11:04:14,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 11:04:14,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 11:04:14,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 11:04:14,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 11:04:14,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 11:04:14,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 11:04:14,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 11:04:14,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 11:04:14,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 11:04:14,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 11:04:14,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 11:04:14,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 11:04:14,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 11:04:14,594 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 11:04:14,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 11:04:14,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 11:04:14,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 11:04:14,595 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-02 11:04:14,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 11:04:14,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 11:04:14,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 11:04:14,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 11:04:14,607 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 11:04:14,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 11:04:14,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 11:04:14,607 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 11:04:14,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 11:04:14,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 11:04:14,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 11:04:14,608 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 11:04:14,608 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 11:04:14,608 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 11:04:14,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 11:04:14,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 11:04:14,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 11:04:14,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 11:04:14,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 11:04:14,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 11:04:14,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 11:04:14,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 11:04:14,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-02 11:04:14,610 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-02 11:04:14,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:14,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 11:04:14,647 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 11:04:14,650 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 11:04:14,651 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 11:04:14,652 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 11:04:14,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-02-02 11:04:14,794 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 11:04:14,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 11:04:14,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 11:04:14,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 11:04:14,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 11:04:14,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14, skipping insertion in model container [2018-02-02 11:04:14,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,813 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:04:14,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:04:14,936 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:04:14,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:04:14,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14 WrapperNode [2018-02-02 11:04:14,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 11:04:14,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 11:04:14,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 11:04:14,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 11:04:14,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... [2018-02-02 11:04:14,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 11:04:14,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 11:04:14,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 11:04:14,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 11:04:14,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 11:04:15,007 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 11:04:15,007 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 11:04:15,007 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 11:04:15,007 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 11:04:15,007 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 11:04:15,008 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-02-02 11:04:15,008 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-02 11:04:15,008 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 11:04:15,008 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 11:04:15,008 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 11:04:15,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 11:04:15,177 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 11:04:15,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:04:15 BoogieIcfgContainer [2018-02-02 11:04:15,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 11:04:15,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 11:04:15,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 11:04:15,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 11:04:15,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 11:04:14" (1/3) ... [2018-02-02 11:04:15,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bee3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:04:15, skipping insertion in model container [2018-02-02 11:04:15,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:04:14" (2/3) ... [2018-02-02 11:04:15,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bee3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:04:15, skipping insertion in model container [2018-02-02 11:04:15,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:04:15" (3/3) ... [2018-02-02 11:04:15,183 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-02-02 11:04:15,187 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 11:04:15,191 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 11:04:15,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 11:04:15,222 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 11:04:15,223 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-02 11:04:15,223 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 11:04:15,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 11:04:15,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 11:04:15,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 11:04:15,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 11:04:15,224 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 11:04:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-02-02 11:04:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 11:04:15,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:15,244 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 11:04:15,244 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:15,248 INFO L82 PathProgramCache]: Analyzing trace with hash 3351521, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:15,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:15,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 11:04:15,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,332 INFO L182 omatonBuilderFactory]: Interpolants [72#true, 73#false, 74#(= 1 (select |#valid| |~#a6.base|))] [2018-02-02 11:04:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 11:04:15,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 11:04:15,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 11:04:15,342 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-02-02 11:04:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:15,424 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-02 11:04:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 11:04:15,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 11:04:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:15,433 INFO L225 Difference]: With dead ends: 82 [2018-02-02 11:04:15,433 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 11:04:15,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 11:04:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 11:04:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-02-02 11:04:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 11:04:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 11:04:15,465 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 4 [2018-02-02 11:04:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:15,465 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 11:04:15,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 11:04:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 11:04:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 11:04:15,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:15,466 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 11:04:15,466 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:15,466 INFO L82 PathProgramCache]: Analyzing trace with hash 3351522, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:15,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:15,480 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 11:04:15,484 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:15,484 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:15,485 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:15,485 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:15,568 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-02 11:04:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:15,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 11:04:15,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:15,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-02-02 11:04:15,623 INFO L182 omatonBuilderFactory]: Interpolants [227#true, 228#false, 229#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 230#(and (= 4 (select |#length| |~#a6.base|)) (<= (+ |~#a6.offset| 4) (select |#length| |~#a6.base|)) (<= 0 |~#a6.offset|))] [2018-02-02 11:04:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 11:04:15,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 11:04:15,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 11:04:15,625 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 4 states. [2018-02-02 11:04:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:15,676 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-02-02 11:04:15,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 11:04:15,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-02 11:04:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:15,678 INFO L225 Difference]: With dead ends: 122 [2018-02-02 11:04:15,678 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 11:04:15,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 11:04:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 11:04:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-02-02 11:04:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 11:04:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-02-02 11:04:15,689 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 4 [2018-02-02 11:04:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:15,689 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-02-02 11:04:15,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 11:04:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-02-02 11:04:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:04:15,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:15,691 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:15,691 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 312821243, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:15,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:15,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 11:04:15,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,821 INFO L182 omatonBuilderFactory]: Interpolants [480#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 481#(= 3 probe3_6_~ret~0), 486#(= |probe3_6_#res| 3), 487#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 460#true, 461#false, 477#(= 3 |entry_point_#t~ret9|), 478#(not (= 0 entry_point_~ret~1)), 479#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 11:04:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:04:15,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:04:15,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:04:15,822 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 9 states. [2018-02-02 11:04:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:16,196 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-02-02 11:04:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 11:04:16,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 11:04:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:16,201 INFO L225 Difference]: With dead ends: 122 [2018-02-02 11:04:16,201 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 11:04:16,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-02 11:04:16,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 11:04:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-02-02 11:04:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 11:04:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-02-02 11:04:16,212 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 24 [2018-02-02 11:04:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:16,212 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-02-02 11:04:16,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:04:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-02-02 11:04:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:04:16,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:16,213 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:16,213 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1854259380, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:16,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:16,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 11:04:16,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,283 INFO L182 omatonBuilderFactory]: Interpolants [736#(= 0 probe3_6_~p~0.offset), 724#true, 740#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 725#false, 741#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 742#(= 0 |ldv_malloc_#res.offset|), 735#(= 0 |probe3_6_#t~ret4.offset|)] [2018-02-02 11:04:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:04:16,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:04:16,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:04:16,284 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 7 states. [2018-02-02 11:04:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:16,515 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-02-02 11:04:16,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 11:04:16,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 11:04:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:16,516 INFO L225 Difference]: With dead ends: 106 [2018-02-02 11:04:16,516 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 11:04:16,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:04:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 11:04:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-02-02 11:04:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 11:04:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2018-02-02 11:04:16,521 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 24 [2018-02-02 11:04:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:16,521 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2018-02-02 11:04:16,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:04:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2018-02-02 11:04:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:04:16,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:16,522 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:16,522 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1854259381, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:16,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:16,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 11:04:16,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,640 INFO L182 omatonBuilderFactory]: Interpolants [960#false, 976#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 977#(= 0 |ldv_malloc_#res.base|), 970#(= 0 |probe3_6_#t~ret4.base|), 971#(= 0 probe3_6_~p~0.base), 959#true, 975#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 11:04:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:04:16,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:04:16,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:04:16,641 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 7 states. [2018-02-02 11:04:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:16,821 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-02-02 11:04:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 11:04:16,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 11:04:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:16,823 INFO L225 Difference]: With dead ends: 116 [2018-02-02 11:04:16,823 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 11:04:16,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:04:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 11:04:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2018-02-02 11:04:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 11:04:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-02-02 11:04:16,831 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 24 [2018-02-02 11:04:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:16,831 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-02-02 11:04:16,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:04:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-02-02 11:04:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:04:16,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:16,832 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:16,832 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417000, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:16,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:16,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 11:04:16,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,924 INFO L182 omatonBuilderFactory]: Interpolants [1232#(not (= 0 |probe3_6_#t~ret4.base|)), 1233#(not (= 0 probe3_6_~p~0.base)), 1234#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1235#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1236#(not (= 0 |ldv_malloc_#res.base|)), 1205#true, 1206#false, 1224#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1225#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 11:04:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:16,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:04:16,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:04:16,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:04:16,924 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 9 states. [2018-02-02 11:04:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:17,041 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-02-02 11:04:17,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 11:04:17,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 11:04:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:17,042 INFO L225 Difference]: With dead ends: 100 [2018-02-02 11:04:17,042 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 11:04:17,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:04:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 11:04:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-02-02 11:04:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 11:04:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-02-02 11:04:17,048 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 24 [2018-02-02 11:04:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:17,048 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-02-02 11:04:17,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:04:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-02-02 11:04:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 11:04:17,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:17,049 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:17,049 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961130, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:17,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:17,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 11:04:17,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,109 INFO L182 omatonBuilderFactory]: Interpolants [1456#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1457#(= 0 |ldv_malloc_#t~malloc1.offset|), 1458#(= 0 |ldv_malloc_#res.offset|), 1450#(= 0 |probe3_6_#t~ret4.offset|), 1451#(= 0 probe3_6_~p~0.offset), 1437#true, 1438#false, 1455#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 11:04:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 11:04:17,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 11:04:17,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 11:04:17,109 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 8 states. [2018-02-02 11:04:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:17,232 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-02-02 11:04:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 11:04:17,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-02 11:04:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:17,233 INFO L225 Difference]: With dead ends: 98 [2018-02-02 11:04:17,234 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 11:04:17,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 11:04:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 11:04:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-02 11:04:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 11:04:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-02-02 11:04:17,237 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 26 [2018-02-02 11:04:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:17,237 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-02-02 11:04:17,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 11:04:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-02-02 11:04:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 11:04:17,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:17,238 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:17,238 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:17,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961129, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:17,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,250 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 11:04:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:17,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 11:04:17,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,322 INFO L182 omatonBuilderFactory]: Interpolants [1664#false, 1681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1682#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1683#(= |#valid| |old(#valid)|), 1684#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1685#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1676#(= 1 (select |#valid| |probe3_6_#t~ret4.base|)), 1677#(= 1 (select |#valid| probe3_6_~p~0.base)), 1663#true] [2018-02-02 11:04:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:04:17,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:04:17,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:04:17,323 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 9 states. [2018-02-02 11:04:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:17,487 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2018-02-02 11:04:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 11:04:17,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 11:04:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:17,488 INFO L225 Difference]: With dead ends: 96 [2018-02-02 11:04:17,488 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 11:04:17,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:04:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 11:04:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-02 11:04:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 11:04:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2018-02-02 11:04:17,492 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 26 [2018-02-02 11:04:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:17,492 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2018-02-02 11:04:17,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:04:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2018-02-02 11:04:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 11:04:17,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:17,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:17,493 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -22900890, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:17,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:04:17,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 11:04:17,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,552 INFO L182 omatonBuilderFactory]: Interpolants [1889#(and (= 0 |probe3_6_#t~ret4.base|) (= 0 |probe3_6_#t~ret4.offset|)), 1890#(and (= probe3_6_~p~0.offset 0) (= probe3_6_~p~0.base 0)), 1878#true, 1879#false, 1897#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1898#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1899#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|))] [2018-02-02 11:04:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:17,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:04:17,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:04:17,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:04:17,553 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 7 states. [2018-02-02 11:04:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:17,645 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-02-02 11:04:17,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 11:04:17,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 11:04:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:17,646 INFO L225 Difference]: With dead ends: 64 [2018-02-02 11:04:17,646 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 11:04:17,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:04:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 11:04:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 11:04:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 11:04:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-02 11:04:17,649 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 30 [2018-02-02 11:04:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:17,649 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-02 11:04:17,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:04:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-02 11:04:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 11:04:17,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:17,650 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:17,650 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 11:04:17,650 INFO L82 PathProgramCache]: Analyzing trace with hash -903148600, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:17,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,704 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-02-02 11:04:17,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:17,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:17,710 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:17,710 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:17,710 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:17,710 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:04:17,719 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 Received shutdown request... [2018-02-02 11:05:37,941 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 11:05:37,944 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 11:05:37,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 11:05:37 BoogieIcfgContainer [2018-02-02 11:05:37,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 11:05:37,945 INFO L168 Benchmark]: Toolchain (without parser) took 83150.66 ms. Allocated memory was 398.5 MB in the beginning and 677.4 MB in the end (delta: 278.9 MB). Free memory was 355.1 MB in the beginning and 506.5 MB in the end (delta: -151.3 MB). Peak memory consumption was 127.6 MB. Max. memory is 5.3 GB. [2018-02-02 11:05:37,946 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 11:05:37,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.68 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 11:05:37,947 INFO L168 Benchmark]: Boogie Preprocessor took 21.05 ms. Allocated memory is still 398.5 MB. Free memory was 341.9 MB in the beginning and 340.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 11:05:37,947 INFO L168 Benchmark]: RCFGBuilder took 204.09 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 318.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 11:05:37,948 INFO L168 Benchmark]: TraceAbstraction took 82766.40 ms. Allocated memory was 398.5 MB in the beginning and 677.4 MB in the end (delta: 278.9 MB). Free memory was 318.1 MB in the beginning and 506.5 MB in the end (delta: -188.4 MB). Peak memory consumption was 90.5 MB. Max. memory is 5.3 GB. [2018-02-02 11:05:37,950 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 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.68 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.05 ms. Allocated memory is still 398.5 MB. Free memory was 341.9 MB in the beginning and 340.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 204.09 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 318.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 82766.40 ms. Allocated memory was 398.5 MB in the beginning and 677.4 MB in the end (delta: 278.9 MB). Free memory was 318.1 MB in the beginning and 506.5 MB in the end (delta: -188.4 MB). Peak memory consumption was 90.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1468). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1468). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1479]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1479). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1459). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1459). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 69 locations, 15 error locations. TIMEOUT Result, 82.7s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 504 SDtfs, 501 SDslu, 1094 SDs, 0 SdLazy, 1479 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 56 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 2 QuantifiedInterpolants, 13608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_11-05-37-960.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_11-05-37-960.csv Completed graceful shutdown