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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 20:48:27,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 20:48:27,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 20:48:27,475 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 20:48:27,475 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 20:48:27,476 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 20:48:27,477 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 20:48:27,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 20:48:27,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 20:48:27,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 20:48:27,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 20:48:27,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 20:48:27,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 20:48:27,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 20:48:27,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 20:48:27,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 20:48:27,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 20:48:27,489 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 20:48:27,490 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 20:48:27,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 20:48:27,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 20:48:27,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 20:48:27,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 20:48:27,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 20:48:27,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 20:48:27,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 20:48:27,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 20:48:27,496 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 20:48:27,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 20:48:27,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 20:48:27,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 20:48:27,497 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 20:48:27,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 20:48:27,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 20:48:27,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 20:48:27,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 20:48:27,509 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 20:48:27,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 20:48:27,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 20:48:27,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 20:48:27,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 20:48:27,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 20:48:27,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 20:48:27,510 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 20:48:27,511 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 20:48:27,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 20:48:27,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 20:48:27,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 20:48:27,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 20:48:27,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 20:48:27,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 20:48:27,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:48:27,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 20:48:27,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 20:48:27,512 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 20:48:27,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:48:27,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 20:48:27,550 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 20:48:27,554 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 20:48:27,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 20:48:27,555 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 20:48:27,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-04 20:48:27,713 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 20:48:27,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 20:48:27,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 20:48:27,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 20:48:27,718 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 20:48:27,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27, skipping insertion in model container [2018-02-04 20:48:27,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,731 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:48:27,766 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:48:27,858 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:48:27,873 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:48:27,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27 WrapperNode [2018-02-04 20:48:27,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 20:48:27,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 20:48:27,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 20:48:27,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 20:48:27,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (1/1) ... [2018-02-04 20:48:27,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 20:48:27,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 20:48:27,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 20:48:27,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 20:48:27,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (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-04 20:48:27,952 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 20:48:27,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 20:48:27,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 20:48:27,953 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 20:48:27,953 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 20:48:27,953 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 20:48:27,953 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-02-04 20:48:27,953 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 20:48:27,954 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 20:48:27,954 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 20:48:27,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 20:48:28,124 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 20:48:28,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:48:28 BoogieIcfgContainer [2018-02-04 20:48:28,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 20:48:28,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 20:48:28,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 20:48:28,127 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 20:48:28,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 08:48:27" (1/3) ... [2018-02-04 20:48:28,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5233ce21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:48:28, skipping insertion in model container [2018-02-04 20:48:28,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:48:27" (2/3) ... [2018-02-04 20:48:28,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5233ce21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:48:28, skipping insertion in model container [2018-02-04 20:48:28,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:48:28" (3/3) ... [2018-02-04 20:48:28,129 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-04 20:48:28,134 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 20:48:28,138 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 20:48:28,171 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 20:48:28,171 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 20:48:28,171 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 20:48:28,171 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 20:48:28,172 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 20:48:28,172 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 20:48:28,172 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 20:48:28,172 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 20:48:28,173 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 20:48:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-04 20:48:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:48:28,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:28,192 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:48:28,192 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash 3053611, 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-04 20:48:28,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:28,254 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-04 20:48:28,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:28,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:48:28,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:28,273 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-04 20:48:28,273 INFO L182 omatonBuilderFactory]: Interpolants [64#(= 1 (select |#valid| |~#a6.base|)), 62#true, 63#false] [2018-02-04 20:48:28,274 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-04 20:48:28,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 20:48:28,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 20:48:28,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:48:28,284 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-02-04 20:48:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:28,331 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 20:48:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 20:48:28,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 20:48:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:28,339 INFO L225 Difference]: With dead ends: 68 [2018-02-04 20:48:28,340 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 20:48:28,341 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-04 20:48:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 20:48:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-02-04 20:48:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 20:48:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 20:48:28,369 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2018-02-04 20:48:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:28,370 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 20:48:28,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 20:48:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 20:48:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:48:28,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:28,370 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:48:28,371 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash 3053612, 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-04 20:48:28,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:28,384 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:48:28,387 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:28,387 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:28,388 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:28,388 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:28,420 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-04 20:48:28,455 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-04 20:48:28,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:28,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:48:28,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:28,487 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-04 20:48:28,487 INFO L182 omatonBuilderFactory]: Interpolants [197#true, 198#false, 199#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 200#(and (= 4 (select |#length| |~#a6.base|)) (<= (+ |~#a6.offset| 4) (select |#length| |~#a6.base|)) (<= 0 |~#a6.offset|))] [2018-02-04 20:48:28,488 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-04 20:48:28,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 20:48:28,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 20:48:28,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 20:48:28,540 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 4 states. [2018-02-04 20:48:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:28,584 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-02-04 20:48:28,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 20:48:28,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 20:48:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:28,586 INFO L225 Difference]: With dead ends: 110 [2018-02-04 20:48:28,586 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 20:48:28,587 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-04 20:48:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 20:48:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-02-04 20:48:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 20:48:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-02-04 20:48:28,597 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 4 [2018-02-04 20:48:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:28,598 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-02-04 20:48:28,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 20:48:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-02-04 20:48:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 20:48:28,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:28,599 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-04 20:48:28,599 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066521, 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-04 20:48:28,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:28,665 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-04 20:48:28,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:28,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 20:48:28,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:28,684 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-04 20:48:28,684 INFO L182 omatonBuilderFactory]: Interpolants [423#(= 0 |probe1_6_#t~ret4.offset|), 424#(= 0 probe1_6_~p~0.offset), 412#true, 428#(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)|)), 413#false, 429#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 430#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 20:48:28,685 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-04 20:48:28,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 20:48:28,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 20:48:28,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 20:48:28,686 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 7 states. [2018-02-04 20:48:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:29,016 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-04 20:48:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 20:48:29,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 20:48:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:29,019 INFO L225 Difference]: With dead ends: 115 [2018-02-04 20:48:29,019 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 20:48:29,020 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-04 20:48:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 20:48:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-02-04 20:48:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 20:48:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-02-04 20:48:29,026 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 24 [2018-02-04 20:48:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:29,026 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-02-04 20:48:29,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 20:48:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-02-04 20:48:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 20:48:29,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:29,027 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-04 20:48:29,027 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066522, 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-04 20:48:29,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,105 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-04 20:48:29,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:29,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 20:48:29,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:29,122 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-04 20:48:29,122 INFO L182 omatonBuilderFactory]: Interpolants [656#(= 0 |probe1_6_#t~ret4.base|), 657#(= 0 probe1_6_~p~0.base), 645#true, 661#(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)|)), 646#false, 662#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 663#(= 0 |ldv_malloc_#res.base|)] [2018-02-04 20:48:29,122 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-04 20:48:29,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 20:48:29,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 20:48:29,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 20:48:29,123 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 7 states. [2018-02-04 20:48:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:29,335 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-02-04 20:48:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 20:48:29,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 20:48:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:29,337 INFO L225 Difference]: With dead ends: 99 [2018-02-04 20:48:29,337 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 20:48:29,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-04 20:48:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 20:48:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-02-04 20:48:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 20:48:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-02-04 20:48:29,343 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 24 [2018-02-04 20:48:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:29,344 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-02-04 20:48:29,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 20:48:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-02-04 20:48:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 20:48:29,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:29,345 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-04 20:48:29,345 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash 995391925, 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-04 20:48:29,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,447 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-04 20:48:29,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:29,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 20:48:29,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:29,464 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-04 20:48:29,464 INFO L182 omatonBuilderFactory]: Interpolants [880#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 887#(not (= 0 |probe1_6_#t~ret4.base|)), 888#(not (= 0 probe1_6_~p~0.base)), 889#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 890#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 891#(not (= 0 |ldv_malloc_#res.base|)), 860#true, 861#false, 879#(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-04 20:48:29,464 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-04 20:48:29,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:48:29,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:48:29,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:48:29,465 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2018-02-04 20:48:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:29,629 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-02-04 20:48:29,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 20:48:29,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 20:48:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:29,630 INFO L225 Difference]: With dead ends: 93 [2018-02-04 20:48:29,630 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 20:48:29,631 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-04 20:48:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 20:48:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-04 20:48:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 20:48:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-02-04 20:48:29,635 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-02-04 20:48:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:29,636 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-02-04 20:48:29,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:48:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-02-04 20:48:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 20:48:29,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:29,637 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-04 20:48:29,637 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763835, 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-04 20:48:29,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,706 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-04 20:48:29,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:29,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 20:48:29,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:29,730 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-04 20:48:29,730 INFO L182 omatonBuilderFactory]: Interpolants [1091#(= 0 |probe1_6_#t~ret4.offset|), 1092#(= 0 probe1_6_~p~0.offset), 1078#true, 1079#false, 1096#(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)|)), 1097#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1098#(= 0 |ldv_malloc_#t~malloc1.offset|), 1099#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 20:48:29,730 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-04 20:48:29,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 20:48:29,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 20:48:29,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 20:48:29,731 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 8 states. [2018-02-04 20:48:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:29,859 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-02-04 20:48:29,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 20:48:29,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 20:48:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:29,860 INFO L225 Difference]: With dead ends: 92 [2018-02-04 20:48:29,860 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 20:48:29,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:48:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 20:48:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-02-04 20:48:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 20:48:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-02-04 20:48:29,865 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 26 [2018-02-04 20:48:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:29,865 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-02-04 20:48:29,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 20:48:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-02-04 20:48:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 20:48:29,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:29,866 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-04 20:48:29,867 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763836, 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-04 20:48:29,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,881 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:48:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:29,916 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-04 20:48:29,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:29,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 20:48:29,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:29,934 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-04 20:48:29,934 INFO L182 omatonBuilderFactory]: Interpolants [1312#(= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| 1)), 1303#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 1304#(= 1 (select |#valid| probe1_6_~p~0.base)), 1290#true, 1291#false, 1308#(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)|)), 1309#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1310#(= |#valid| |old(#valid)|), 1311#(= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc1.base| 1))] [2018-02-04 20:48:29,935 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-04 20:48:29,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:48:29,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:48:29,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:48:29,935 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 9 states. [2018-02-04 20:48:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:30,079 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-02-04 20:48:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 20:48:30,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-04 20:48:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:30,080 INFO L225 Difference]: With dead ends: 91 [2018-02-04 20:48:30,080 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 20:48:30,080 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-04 20:48:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 20:48:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-02-04 20:48:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 20:48:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-04 20:48:30,083 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 26 [2018-02-04 20:48:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:30,084 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-04 20:48:30,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:48:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-04 20:48:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 20:48:30,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:30,084 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-04 20:48:30,084 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash -49598514, 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-04 20:48:30,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,161 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-04 20:48:30,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:48:30,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 20:48:30,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:48:30,178 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-04 20:48:30,178 INFO L182 omatonBuilderFactory]: Interpolants [1506#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|)), 1507#(and (= probe1_6_~p~0.offset 0) (= probe1_6_~p~0.base 0)), 1495#true, 1496#false, 1514#(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)|)), 1515#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1516#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|))] [2018-02-04 20:48:30,178 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-04 20:48:30,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 20:48:30,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 20:48:30,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 20:48:30,179 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-02-04 20:48:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:48:30,285 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 20:48:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 20:48:30,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 20:48:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:48:30,286 INFO L225 Difference]: With dead ends: 65 [2018-02-04 20:48:30,286 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 20:48:30,286 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-04 20:48:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 20:48:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 20:48:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 20:48:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 20:48:30,288 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 30 [2018-02-04 20:48:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:48:30,288 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 20:48:30,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 20:48:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 20:48:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 20:48:30,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:48:30,289 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-04 20:48:30,289 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 20:48:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706416, 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-04 20:48:30,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:48:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:48:30,333 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:48:30,367 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:30,368 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:30,368 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:30,368 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:30,368 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:30,368 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:48:30,381 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 20:52:06,886 WARN L143 SmtUtils]: Spent 216492ms on a formula simplification that was a NOOP. DAG size: 76 [2018-02-04 20:52:10,892 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= %0 v_prenex_5) [2018-02-04 20:52:12,898 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= %0 v_prenex_5) [2018-02-04 20:52:14,902 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= 1 (select v_prenex_1 v_prenex_5)) [2018-02-04 20:52:16,904 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= 1 (select v_prenex_1 v_prenex_5)) [2018-02-04 20:52:16,904 INFO L303 Elim1Store]: Index analysis took 10016 ms Received shutdown request... [2018-02-04 20:52:20,911 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 20:52:20,914 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 20:52:20,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 08:52:20 BoogieIcfgContainer [2018-02-04 20:52:20,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 20:52:20,915 INFO L168 Benchmark]: Toolchain (without parser) took 233202.05 ms. Allocated memory was 403.2 MB in the beginning and 691.0 MB in the end (delta: 287.8 MB). Free memory was 357.2 MB in the beginning and 595.7 MB in the end (delta: -238.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:52:20,916 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 403.2 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:52:20,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.89 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 344.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 20:52:20,917 INFO L168 Benchmark]: Boogie Preprocessor took 29.31 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 342.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:52:20,918 INFO L168 Benchmark]: RCFGBuilder took 213.46 ms. Allocated memory is still 403.2 MB. Free memory was 342.6 MB in the beginning and 321.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 20:52:20,918 INFO L168 Benchmark]: TraceAbstraction took 232789.77 ms. Allocated memory was 403.2 MB in the beginning and 691.0 MB in the end (delta: 287.8 MB). Free memory was 321.5 MB in the beginning and 595.7 MB in the end (delta: -274.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. [2018-02-04 20:52:20,920 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 403.2 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.89 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 344.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.31 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 342.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 213.46 ms. Allocated memory is still 403.2 MB. Free memory was 342.6 MB in the beginning and 321.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 232789.77 ms. Allocated memory was 403.2 MB in the beginning and 691.0 MB in the end (delta: 287.8 MB). Free memory was 321.5 MB in the beginning and 595.7 MB in the end (delta: -274.2 MB). Peak memory consumption was 13.6 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 1465). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). 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 13. - TimeoutResultAtElement [Line: 1476]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1473). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1473). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1457). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1457). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). 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 13. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 59 locations, 9 error locations. TIMEOUT Result, 232.7s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 424 SDtfs, 330 SDslu, 857 SDs, 0 SdLazy, 1143 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred 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, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 2 QuantifiedInterpolants, 11843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_20-52-20-928.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_20-52-20-928.csv Completed graceful shutdown