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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memsetNonZero2_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 15:14:56,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 15:14:56,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 15:14:56,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 15:14:56,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 15:14:56,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 15:14:56,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 15:14:56,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 15:14:56,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 15:14:56,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 15:14:56,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 15:14:56,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 15:14:56,635 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 15:14:56,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 15:14:56,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 15:14:56,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 15:14:56,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 15:14:56,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 15:14:56,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 15:14:56,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 15:14:56,642 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 15:14:56,642 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 15:14:56,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 15:14:56,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 15:14:56,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 15:14:56,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 15:14:56,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 15:14:56,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 15:14:56,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 15:14:56,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 15:14:56,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 15:14:56,646 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-04-13 15:14:56,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 15:14:56,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 15:14:56,659 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 15:14:56,659 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 15:14:56,659 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 15:14:56,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 15:14:56,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 15:14:56,660 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 15:14:56,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 15:14:56,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 15:14:56,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 15:14:56,660 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 15:14:56,660 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 15:14:56,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 15:14:56,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 15:14:56,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 15:14:56,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 15:14:56,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 15:14:56,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 15:14:56,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 15:14:56,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 15:14:56,661 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-04-13 15:14:56,662 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-04-13 15:14:56,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 15:14:56,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 15:14:56,705 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 15:14:56,710 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 15:14:56,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 15:14:56,712 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 15:14:56,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memsetNonZero2_true-valid-memsafety_true-termination.c [2018-04-13 15:14:56,993 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5025dd1bc [2018-04-13 15:14:57,080 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 15:14:57,080 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 15:14:57,081 INFO L168 CDTParser]: Scanning memsetNonZero2_true-valid-memsafety_true-termination.c [2018-04-13 15:14:57,082 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 15:14:57,082 INFO L215 ultiparseSymbolTable]: [2018-04-13 15:14:57,082 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 15:14:57,082 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in memsetNonZero2_true-valid-memsafety_true-termination.c [2018-04-13 15:14:57,082 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 15:14:57,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fmemsetNonZero__true_valid_memsafety_true_termination_c__size_t in memsetNonZero2_true-valid-memsafety_true-termination.c [2018-04-13 15:14:57,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fmemsetNonZero__true_valid_memsafety_true_termination_c____kernel_size_t in memsetNonZero2_true-valid-memsafety_true-termination.c [2018-04-13 15:14:57,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fmemsetNonZero__true_valid_memsafety_true_termination_c____u32 in memsetNonZero2_true-valid-memsafety_true-termination.c [2018-04-13 15:14:57,094 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5025dd1bc [2018-04-13 15:14:57,097 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 15:14:57,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 15:14:57,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 15:14:57,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 15:14:57,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 15:14:57,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2e1663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57, skipping insertion in model container [2018-04-13 15:14:57,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,116 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 15:14:57,125 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 15:14:57,214 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 15:14:57,232 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 15:14:57,236 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 7 non ball SCCs. Number of states in SCCs 7. [2018-04-13 15:14:57,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57 WrapperNode [2018-04-13 15:14:57,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 15:14:57,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 15:14:57,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 15:14:57,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 15:14:57,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (1/1) ... [2018-04-13 15:14:57,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 15:14:57,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 15:14:57,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 15:14:57,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 15:14:57,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (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-04-13 15:14:57,297 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 15:14:57,297 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 15:14:57,297 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 15:14:57,297 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-04-13 15:14:57,297 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-04-13 15:14:57,297 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 15:14:57,297 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 15:14:57,297 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-04-13 15:14:57,298 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 15:14:57,298 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 15:14:57,298 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 15:14:57,411 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-13 15:14:57,441 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 15:14:57,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:14:57 BoogieIcfgContainer [2018-04-13 15:14:57,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 15:14:57,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 15:14:57,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 15:14:57,445 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 15:14:57,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:14:57" (1/3) ... [2018-04-13 15:14:57,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a083129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:14:57, skipping insertion in model container [2018-04-13 15:14:57,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:14:57" (2/3) ... [2018-04-13 15:14:57,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a083129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:14:57, skipping insertion in model container [2018-04-13 15:14:57,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:14:57" (3/3) ... [2018-04-13 15:14:57,447 INFO L107 eAbstractionObserver]: Analyzing ICFG memsetNonZero2_true-valid-memsafety_true-termination.c [2018-04-13 15:14:57,452 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 15:14:57,456 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-04-13 15:14:57,478 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 15:14:57,478 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 15:14:57,478 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 15:14:57,478 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-04-13 15:14:57,478 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 15:14:57,478 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 15:14:57,478 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 15:14:57,478 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 15:14:57,479 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 15:14:57,479 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 15:14:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-04-13 15:14:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-13 15:14:57,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:57,491 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:57,492 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash 682221498, 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-04-13 15:14:57,502 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:57,524 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-13 15:14:57,537 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,538 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,539 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,539 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,566 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true [2018-04-13 15:14:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:57,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 15:14:57,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 15:14:57,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:57,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-04-13 15:14:57,623 INFO L182 omatonBuilderFactory]: Interpolants [32#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 25#true, 26#false, 30#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 31#(= 1 (select |#valid| |main_~#cstats~0.base|))] [2018-04-13 15:14:57,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-04-13 15:14:57,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 15:14:57,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 15:14:57,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-13 15:14:57,632 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-04-13 15:14:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:57,698 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-04-13 15:14:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 15:14:57,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-04-13 15:14:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:57,707 INFO L225 Difference]: With dead ends: 21 [2018-04-13 15:14:57,707 INFO L226 Difference]: Without dead ends: 18 [2018-04-13 15:14:57,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-04-13 15:14:57,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-04-13 15:14:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-04-13 15:14:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-04-13 15:14:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-04-13 15:14:57,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2018-04-13 15:14:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:57,735 INFO L459 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-04-13 15:14:57,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 15:14:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-04-13 15:14:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-13 15:14:57,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:57,736 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:57,736 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 682221499, 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-04-13 15:14:57,744 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:57,755 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-13 15:14:57,758 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,758 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,758 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,759 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-13 15:14:57,768 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 40) (store |c_#length| %1 40)) :qid itp)) :qid itp)) is different from true [2018-04-13 15:14:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:57,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-04-13 15:14:57,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 15:14:57,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 15:14:57,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:57,848 INFO L182 omatonBuilderFactory]: Interpolants [80#(and (<= (+ |main_~#cstats~0.offset| 40) (select |#length| |main_~#cstats~0.base|)) (<= 0 |main_~#cstats~0.offset|) (= 40 (select |#length| |main_~#cstats~0.base|))), 81#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 74#true, 75#false, 79#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 40) (store |#length| %1 40)) :qid itp)) :qid itp))] [2018-04-13 15:14:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:57,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 15:14:57,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 15:14:57,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-13 15:14:57,850 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-04-13 15:14:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:57,899 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-04-13 15:14:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 15:14:57,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-04-13 15:14:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:57,900 INFO L225 Difference]: With dead ends: 17 [2018-04-13 15:14:57,900 INFO L226 Difference]: Without dead ends: 17 [2018-04-13 15:14:57,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=11, Unknown=3, NotChecked=6, Total=30 [2018-04-13 15:14:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-04-13 15:14:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-04-13 15:14:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-04-13 15:14:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-04-13 15:14:57,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2018-04-13 15:14:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:57,904 INFO L459 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-04-13 15:14:57,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 15:14:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-04-13 15:14:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 15:14:57,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:57,905 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:57,905 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash -898824040, 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-04-13 15:14:57,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:57,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 15:14:57,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 15:14:57,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:57,975 INFO L182 omatonBuilderFactory]: Interpolants [128#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 129#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 130#(<= |#Ultimate.C_memset_#amount| 0), 118#true, 119#false] [2018-04-13 15:14:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:57,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 15:14:57,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 15:14:57,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 15:14:57,976 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-04-13 15:14:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:58,034 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-04-13 15:14:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 15:14:58,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 15:14:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:58,035 INFO L225 Difference]: With dead ends: 20 [2018-04-13 15:14:58,036 INFO L226 Difference]: Without dead ends: 18 [2018-04-13 15:14:58,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 15:14:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-04-13 15:14:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-04-13 15:14:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-04-13 15:14:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-04-13 15:14:58,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-04-13 15:14:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:58,039 INFO L459 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-04-13 15:14:58,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 15:14:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-04-13 15:14:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 15:14:58,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:58,040 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:58,040 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1616948477, 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-04-13 15:14:58,042 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:58,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 15:14:58,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,097 INFO L182 omatonBuilderFactory]: Interpolants [184#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 185#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 186#(or (and (< |#Ultimate.C_memset_#t~loopctr5| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr5|) (<= |#Ultimate.C_memset_#amount| 1))), 187#(<= |#Ultimate.C_memset_#amount| 1), 173#true, 174#false] [2018-04-13 15:14:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 15:14:58,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 15:14:58,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 15:14:58,098 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-04-13 15:14:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:58,174 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-04-13 15:14:58,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 15:14:58,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-13 15:14:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:58,175 INFO L225 Difference]: With dead ends: 21 [2018-04-13 15:14:58,175 INFO L226 Difference]: Without dead ends: 19 [2018-04-13 15:14:58,176 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-13 15:14:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-04-13 15:14:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-04-13 15:14:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-04-13 15:14:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-04-13 15:14:58,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-04-13 15:14:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:58,178 INFO L459 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-04-13 15:14:58,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 15:14:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-04-13 15:14:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 15:14:58,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:58,179 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:58,179 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1998482120, now seen corresponding path program 2 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-04-13 15:14:58,182 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:58,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 15:14:58,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,234 INFO L182 omatonBuilderFactory]: Interpolants [246#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 247#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 248#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 249#(= 2 |#Ultimate.C_memset_#t~loopctr5|), 234#true, 250#(not (= 40 |#Ultimate.C_memset_#amount|)), 235#false] [2018-04-13 15:14:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 15:14:58,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 15:14:58,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 15:14:58,234 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-04-13 15:14:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:58,329 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-04-13 15:14:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 15:14:58,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-04-13 15:14:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:58,330 INFO L225 Difference]: With dead ends: 22 [2018-04-13 15:14:58,330 INFO L226 Difference]: Without dead ends: 20 [2018-04-13 15:14:58,330 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-13 15:14:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-04-13 15:14:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-04-13 15:14:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-04-13 15:14:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-04-13 15:14:58,332 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-04-13 15:14:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:58,333 INFO L459 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-04-13 15:14:58,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 15:14:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-04-13 15:14:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 15:14:58,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:58,333 INFO L355 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:58,333 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1887286365, now seen corresponding path program 3 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-04-13 15:14:58,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:58,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 15:14:58,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,418 INFO L182 omatonBuilderFactory]: Interpolants [314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 315#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 316#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 301#true, 317#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 302#false, 318#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 319#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:14:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 15:14:58,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 15:14:58,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-13 15:14:58,418 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-04-13 15:14:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:58,485 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-04-13 15:14:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 15:14:58,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-04-13 15:14:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:58,485 INFO L225 Difference]: With dead ends: 23 [2018-04-13 15:14:58,485 INFO L226 Difference]: Without dead ends: 21 [2018-04-13 15:14:58,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-04-13 15:14:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-04-13 15:14:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-04-13 15:14:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-04-13 15:14:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-04-13 15:14:58,487 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-04-13 15:14:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:58,487 INFO L459 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-04-13 15:14:58,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 15:14:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-04-13 15:14:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 15:14:58,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:58,488 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:58,488 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2087025112, now seen corresponding path program 4 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-04-13 15:14:58,490 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:58,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 15:14:58,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,556 INFO L182 omatonBuilderFactory]: Interpolants [388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 389#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 374#true, 390#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 375#false, 391#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 392#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 393#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 394#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:14:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 15:14:58,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 15:14:58,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-13 15:14:58,557 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2018-04-13 15:14:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:58,635 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-04-13 15:14:58,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 15:14:58,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-13 15:14:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:58,636 INFO L225 Difference]: With dead ends: 24 [2018-04-13 15:14:58,636 INFO L226 Difference]: Without dead ends: 22 [2018-04-13 15:14:58,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-04-13 15:14:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-04-13 15:14:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-04-13 15:14:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-04-13 15:14:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-04-13 15:14:58,638 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-04-13 15:14:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:58,638 INFO L459 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-04-13 15:14:58,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 15:14:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-04-13 15:14:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 15:14:58,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:58,639 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:58,639 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash -311008323, now seen corresponding path program 5 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-04-13 15:14:58,643 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:58,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 15:14:58,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,741 INFO L182 omatonBuilderFactory]: Interpolants [468#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 453#true, 469#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 454#false, 470#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 471#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 472#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 473#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 474#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 475#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:14:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 15:14:58,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 15:14:58,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-04-13 15:14:58,742 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 10 states. [2018-04-13 15:14:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:58,826 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-04-13 15:14:58,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 15:14:58,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-04-13 15:14:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:58,827 INFO L225 Difference]: With dead ends: 25 [2018-04-13 15:14:58,827 INFO L226 Difference]: Without dead ends: 23 [2018-04-13 15:14:58,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-04-13 15:14:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-04-13 15:14:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-04-13 15:14:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-04-13 15:14:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-04-13 15:14:58,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-04-13 15:14:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:58,829 INFO L459 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-04-13 15:14:58,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 15:14:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-04-13 15:14:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 15:14:58,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:58,830 INFO L355 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:58,830 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1635600776, now seen corresponding path program 6 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-04-13 15:14:58,833 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:58,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 15:14:58,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,899 INFO L182 omatonBuilderFactory]: Interpolants [560#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 561#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 562#(not (= 40 |#Ultimate.C_memset_#amount|)), 538#true, 554#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 539#false, 555#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 556#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 557#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 558#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 559#(<= |#Ultimate.C_memset_#t~loopctr5| 4)] [2018-04-13 15:14:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:58,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 15:14:58,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 15:14:58,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-04-13 15:14:58,899 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2018-04-13 15:14:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:58,981 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-04-13 15:14:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 15:14:58,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-13 15:14:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:58,981 INFO L225 Difference]: With dead ends: 26 [2018-04-13 15:14:58,982 INFO L226 Difference]: Without dead ends: 24 [2018-04-13 15:14:58,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-04-13 15:14:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-04-13 15:14:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-04-13 15:14:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-04-13 15:14:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-04-13 15:14:58,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-04-13 15:14:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:58,983 INFO L459 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-04-13 15:14:58,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 15:14:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-04-13 15:14:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 15:14:58,984 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:58,984 INFO L355 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:58,984 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash 251706141, now seen corresponding path program 7 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-04-13 15:14:58,986 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:59,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 15:14:59,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,043 INFO L182 omatonBuilderFactory]: Interpolants [629#true, 630#false, 646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 647#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 648#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 649#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 650#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 651#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 652#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 653#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 654#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 655#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:14:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 15:14:59,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 15:14:59,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-04-13 15:14:59,044 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-04-13 15:14:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:59,153 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-04-13 15:14:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 15:14:59,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-04-13 15:14:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:59,154 INFO L225 Difference]: With dead ends: 27 [2018-04-13 15:14:59,154 INFO L226 Difference]: Without dead ends: 25 [2018-04-13 15:14:59,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-04-13 15:14:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-04-13 15:14:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-04-13 15:14:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-04-13 15:14:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-04-13 15:14:59,156 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-04-13 15:14:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:59,157 INFO L459 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-04-13 15:14:59,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 15:14:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-04-13 15:14:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 15:14:59,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:59,157 INFO L355 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:59,157 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1371321576, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:14:59,160 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:59,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 15:14:59,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,230 INFO L182 omatonBuilderFactory]: Interpolants [744#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 745#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 746#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 747#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 748#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 749#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 750#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 751#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 752#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 753#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 754#(not (= 40 |#Ultimate.C_memset_#amount|)), 726#true, 727#false] [2018-04-13 15:14:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 15:14:59,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 15:14:59,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-04-13 15:14:59,231 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-04-13 15:14:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:59,315 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-04-13 15:14:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 15:14:59,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-04-13 15:14:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:59,316 INFO L225 Difference]: With dead ends: 28 [2018-04-13 15:14:59,316 INFO L226 Difference]: Without dead ends: 26 [2018-04-13 15:14:59,316 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-04-13 15:14:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-04-13 15:14:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-04-13 15:14:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-04-13 15:14:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-04-13 15:14:59,318 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-04-13 15:14:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:59,318 INFO L459 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-04-13 15:14:59,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 15:14:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-04-13 15:14:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 15:14:59,318 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:59,318 INFO L355 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:59,318 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash -145573251, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:14:59,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:59,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 15:14:59,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,419 INFO L182 omatonBuilderFactory]: Interpolants [848#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 849#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 850#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 851#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 852#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 853#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 854#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 855#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 856#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 857#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 858#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 859#(not (= 40 |#Ultimate.C_memset_#amount|)), 829#true, 830#false] [2018-04-13 15:14:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 15:14:59,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 15:14:59,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-13 15:14:59,420 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-04-13 15:14:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:59,581 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-04-13 15:14:59,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 15:14:59,581 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-04-13 15:14:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:59,581 INFO L225 Difference]: With dead ends: 29 [2018-04-13 15:14:59,581 INFO L226 Difference]: Without dead ends: 27 [2018-04-13 15:14:59,582 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2018-04-13 15:14:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-04-13 15:14:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-04-13 15:14:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-04-13 15:14:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-04-13 15:14:59,584 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-04-13 15:14:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:59,585 INFO L459 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-04-13 15:14:59,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 15:14:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-04-13 15:14:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 15:14:59,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:59,586 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:59,586 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:59,586 INFO L82 PathProgramCache]: Analyzing trace with hash -802080840, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:14:59,588 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:59,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 15:14:59,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,669 INFO L182 omatonBuilderFactory]: Interpolants [960#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 961#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 962#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 963#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 964#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 965#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 966#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 967#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 968#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 969#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 938#true, 970#(not (= 40 |#Ultimate.C_memset_#amount|)), 939#false, 958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 959#(= 0 |#Ultimate.C_memset_#t~loopctr5|)] [2018-04-13 15:14:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 15:14:59,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 15:14:59,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2018-04-13 15:14:59,670 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-04-13 15:14:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:14:59,790 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-04-13 15:14:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 15:14:59,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-04-13 15:14:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:14:59,791 INFO L225 Difference]: With dead ends: 30 [2018-04-13 15:14:59,791 INFO L226 Difference]: Without dead ends: 28 [2018-04-13 15:14:59,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2018-04-13 15:14:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-04-13 15:14:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-04-13 15:14:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-04-13 15:14:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-04-13 15:14:59,792 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-04-13 15:14:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:14:59,793 INFO L459 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-04-13 15:14:59,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 15:14:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-04-13 15:14:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 15:14:59,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:14:59,793 INFO L355 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:14:59,793 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:14:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 321020381, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:14:59,796 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:14:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:14:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:14:59,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 15:14:59,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:14:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,908 INFO L182 omatonBuilderFactory]: Interpolants [1074#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1075#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1076#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1077#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1078#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1079#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1080#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1081#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1082#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1083#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1084#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1053#true, 1085#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1054#false, 1086#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1087#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:14:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:14:59,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 15:14:59,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 15:14:59,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-04-13 15:14:59,909 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2018-04-13 15:15:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:00,045 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-04-13 15:15:00,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 15:15:00,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-04-13 15:15:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:00,046 INFO L225 Difference]: With dead ends: 31 [2018-04-13 15:15:00,046 INFO L226 Difference]: Without dead ends: 29 [2018-04-13 15:15:00,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2018-04-13 15:15:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-04-13 15:15:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-04-13 15:15:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-04-13 15:15:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-04-13 15:15:00,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-04-13 15:15:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:00,049 INFO L459 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-04-13 15:15:00,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 15:15:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-04-13 15:15:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 15:15:00,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:00,050 INFO L355 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:00,050 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 777419864, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:00,061 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:00,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 15:15:00,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,155 INFO L182 omatonBuilderFactory]: Interpolants [1196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1197#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1198#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1199#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1200#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1201#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1202#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1203#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1204#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1205#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1174#true, 1206#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1175#false, 1207#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1208#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1209#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1210#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 15:15:00,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 15:15:00,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-04-13 15:15:00,155 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2018-04-13 15:15:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:00,294 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-04-13 15:15:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 15:15:00,295 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-04-13 15:15:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:00,295 INFO L225 Difference]: With dead ends: 32 [2018-04-13 15:15:00,295 INFO L226 Difference]: Without dead ends: 30 [2018-04-13 15:15:00,296 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-04-13 15:15:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-04-13 15:15:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-04-13 15:15:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-04-13 15:15:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-04-13 15:15:00,297 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-04-13 15:15:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:00,297 INFO L459 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-04-13 15:15:00,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 15:15:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-04-13 15:15:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 15:15:00,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:00,297 INFO L355 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:00,298 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2040901949, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:00,301 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:00,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 15:15:00,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,406 INFO L182 omatonBuilderFactory]: Interpolants [1324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1325#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1326#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1327#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1328#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1329#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1330#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1331#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1332#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1301#true, 1333#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1302#false, 1334#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1335#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1336#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1337#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1338#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1339#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 15:15:00,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 15:15:00,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2018-04-13 15:15:00,406 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 18 states. [2018-04-13 15:15:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:00,567 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-04-13 15:15:00,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 15:15:00,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-04-13 15:15:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:00,568 INFO L225 Difference]: With dead ends: 33 [2018-04-13 15:15:00,568 INFO L226 Difference]: Without dead ends: 31 [2018-04-13 15:15:00,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 15:15:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-13 15:15:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-13 15:15:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-13 15:15:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-04-13 15:15:00,570 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-04-13 15:15:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:00,570 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-04-13 15:15:00,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 15:15:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-04-13 15:15:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 15:15:00,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:00,571 INFO L355 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:00,571 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1740826376, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:00,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:00,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 15:15:00,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,682 INFO L182 omatonBuilderFactory]: Interpolants [1472#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1473#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 1474#(not (= 40 |#Ultimate.C_memset_#amount|)), 1458#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1459#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1460#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1461#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1462#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1463#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1464#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1465#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1434#true, 1466#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1435#false, 1467#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1468#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1469#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1470#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1471#(<= |#Ultimate.C_memset_#t~loopctr5| 12)] [2018-04-13 15:15:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 15:15:00,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 15:15:00,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=203, Unknown=0, NotChecked=0, Total=342 [2018-04-13 15:15:00,683 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 19 states. [2018-04-13 15:15:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:00,852 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-04-13 15:15:00,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 15:15:00,852 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-04-13 15:15:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:00,853 INFO L225 Difference]: With dead ends: 34 [2018-04-13 15:15:00,853 INFO L226 Difference]: Without dead ends: 32 [2018-04-13 15:15:00,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 15:15:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-04-13 15:15:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-04-13 15:15:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-04-13 15:15:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-04-13 15:15:00,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-04-13 15:15:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:00,856 INFO L459 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-04-13 15:15:00,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 15:15:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-04-13 15:15:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 15:15:00,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:00,857 INFO L355 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:00,857 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1284679837, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:00,860 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:00,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 15:15:00,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,969 INFO L182 omatonBuilderFactory]: Interpolants [1600#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1601#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1602#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1603#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1604#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1573#true, 1605#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1574#false, 1606#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1607#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1608#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1609#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1610#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1611#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1612#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1613#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 1614#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 1615#(not (= 40 |#Ultimate.C_memset_#amount|)), 1598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1599#(= 0 |#Ultimate.C_memset_#t~loopctr5|)] [2018-04-13 15:15:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:00,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 15:15:00,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 15:15:00,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=224, Unknown=0, NotChecked=0, Total=380 [2018-04-13 15:15:00,969 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 20 states. [2018-04-13 15:15:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:01,156 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-04-13 15:15:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 15:15:01,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-04-13 15:15:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:01,157 INFO L225 Difference]: With dead ends: 35 [2018-04-13 15:15:01,157 INFO L226 Difference]: Without dead ends: 33 [2018-04-13 15:15:01,157 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 15:15:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-04-13 15:15:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-04-13 15:15:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-13 15:15:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-04-13 15:15:01,159 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-04-13 15:15:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:01,159 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-04-13 15:15:01,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 15:15:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-04-13 15:15:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 15:15:01,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:01,159 INFO L355 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:01,159 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash 586091928, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:01,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:01,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:01,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 15:15:01,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:01,286 INFO L182 omatonBuilderFactory]: Interpolants [1760#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 1761#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 1762#(not (= 40 |#Ultimate.C_memset_#amount|)), 1744#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1745#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1746#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1747#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1748#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1749#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1718#true, 1750#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1719#false, 1751#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1752#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1753#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1754#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1755#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1756#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1757#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1758#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1759#(<= |#Ultimate.C_memset_#t~loopctr5| 14)] [2018-04-13 15:15:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:01,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 15:15:01,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 15:15:01,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-04-13 15:15:01,287 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 21 states. [2018-04-13 15:15:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:01,619 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-04-13 15:15:01,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 15:15:01,619 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-04-13 15:15:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:01,620 INFO L225 Difference]: With dead ends: 36 [2018-04-13 15:15:01,620 INFO L226 Difference]: Without dead ends: 34 [2018-04-13 15:15:01,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 15:15:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-04-13 15:15:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-04-13 15:15:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-04-13 15:15:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-04-13 15:15:01,622 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-04-13 15:15:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:01,623 INFO L459 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-04-13 15:15:01,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 15:15:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-04-13 15:15:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 15:15:01,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:01,623 INFO L355 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:01,624 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash 404703229, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:01,627 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:01,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:01,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 15:15:01,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:01,867 INFO L182 omatonBuilderFactory]: Interpolants [1896#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1897#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1898#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1899#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1900#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1869#true, 1901#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1870#false, 1902#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1903#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1904#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1905#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1906#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1907#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1908#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1909#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1910#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1911#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 1912#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 1913#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 1914#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 1915#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:01,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 15:15:01,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 15:15:01,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=269, Unknown=0, NotChecked=0, Total=462 [2018-04-13 15:15:01,867 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 22 states. [2018-04-13 15:15:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:02,143 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-04-13 15:15:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 15:15:02,143 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-04-13 15:15:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:02,143 INFO L225 Difference]: With dead ends: 37 [2018-04-13 15:15:02,143 INFO L226 Difference]: Without dead ends: 35 [2018-04-13 15:15:02,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 15:15:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-13 15:15:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-13 15:15:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-13 15:15:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-04-13 15:15:02,145 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-04-13 15:15:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:02,145 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-04-13 15:15:02,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 15:15:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-04-13 15:15:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 15:15:02,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:02,146 INFO L355 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:02,146 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash -923379144, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:02,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:02,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:02,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 15:15:02,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:02,324 INFO L182 omatonBuilderFactory]: Interpolants [2054#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2055#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2056#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2057#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2026#true, 2058#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2027#false, 2059#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2060#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2061#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2062#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2063#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2064#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2065#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2066#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2067#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2068#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2069#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2070#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2071#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2072#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2073#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2074#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:02,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 15:15:02,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 15:15:02,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=293, Unknown=0, NotChecked=0, Total=506 [2018-04-13 15:15:02,325 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 23 states. [2018-04-13 15:15:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:02,602 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-04-13 15:15:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 15:15:02,602 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-04-13 15:15:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:02,602 INFO L225 Difference]: With dead ends: 38 [2018-04-13 15:15:02,602 INFO L226 Difference]: Without dead ends: 36 [2018-04-13 15:15:02,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 15:15:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-13 15:15:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-13 15:15:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 15:15:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-04-13 15:15:02,605 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-04-13 15:15:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:02,605 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-04-13 15:15:02,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 15:15:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-04-13 15:15:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 15:15:02,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:02,605 INFO L355 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:02,605 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash 855740253, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:02,608 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:02,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:02,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 15:15:02,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:02,773 INFO L182 omatonBuilderFactory]: Interpolants [2218#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2219#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2220#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2189#true, 2221#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2190#false, 2222#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2223#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2224#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2225#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2226#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2227#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2228#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2229#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2230#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2231#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2232#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2233#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2234#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2235#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2236#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2237#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2238#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2239#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:02,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 15:15:02,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 15:15:02,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=318, Unknown=0, NotChecked=0, Total=552 [2018-04-13 15:15:02,774 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 24 states. [2018-04-13 15:15:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:03,134 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-04-13 15:15:03,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 15:15:03,136 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-04-13 15:15:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:03,137 INFO L225 Difference]: With dead ends: 39 [2018-04-13 15:15:03,137 INFO L226 Difference]: Without dead ends: 37 [2018-04-13 15:15:03,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 15:15:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-04-13 15:15:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-04-13 15:15:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-13 15:15:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-04-13 15:15:03,140 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-04-13 15:15:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:03,140 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-04-13 15:15:03,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 15:15:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-04-13 15:15:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 15:15:03,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:03,141 INFO L355 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:03,141 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash 173866712, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-04-13 15:15:03,145 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:03,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:03,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 15:15:03,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:03,397 INFO L182 omatonBuilderFactory]: Interpolants [2388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2389#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2390#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2391#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2392#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2393#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2394#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2395#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2396#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2397#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2398#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2399#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2400#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2401#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2402#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2403#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2404#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2405#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2406#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2407#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2408#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2409#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2410#(not (= 40 |#Ultimate.C_memset_#amount|)), 2358#true, 2359#false] [2018-04-13 15:15:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:03,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 15:15:03,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 15:15:03,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=344, Unknown=0, NotChecked=0, Total=600 [2018-04-13 15:15:03,398 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 25 states. [2018-04-13 15:15:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:03,653 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-04-13 15:15:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 15:15:03,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-04-13 15:15:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:03,654 INFO L225 Difference]: With dead ends: 40 [2018-04-13 15:15:03,654 INFO L226 Difference]: Without dead ends: 38 [2018-04-13 15:15:03,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 15:15:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-13 15:15:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-04-13 15:15:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-13 15:15:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-04-13 15:15:03,656 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-04-13 15:15:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:03,656 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-04-13 15:15:03,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 15:15:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-04-13 15:15:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 15:15:03,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:03,656 INFO L355 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:03,656 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash 510623421, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:03,658 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:03,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:03,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 15:15:03,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:03,833 INFO L182 omatonBuilderFactory]: Interpolants [2564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2565#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2566#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2567#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2568#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2569#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2570#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2571#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2572#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2573#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2574#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2575#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2576#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2577#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2578#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2579#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2580#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2581#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2582#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2583#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2584#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2585#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2586#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 2587#(not (= 40 |#Ultimate.C_memset_#amount|)), 2533#true, 2534#false] [2018-04-13 15:15:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:03,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 15:15:03,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 15:15:03,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=371, Unknown=0, NotChecked=0, Total=650 [2018-04-13 15:15:03,834 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 26 states. [2018-04-13 15:15:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:04,137 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-04-13 15:15:04,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 15:15:04,137 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-04-13 15:15:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:04,138 INFO L225 Difference]: With dead ends: 41 [2018-04-13 15:15:04,138 INFO L226 Difference]: Without dead ends: 39 [2018-04-13 15:15:04,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 15:15:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-04-13 15:15:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-04-13 15:15:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-04-13 15:15:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-04-13 15:15:04,141 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-04-13 15:15:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:04,141 INFO L459 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-04-13 15:15:04,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 15:15:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-04-13 15:15:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 15:15:04,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:04,142 INFO L355 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:04,142 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1934820488, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:04,146 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:04,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:04,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 15:15:04,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:04,341 INFO L182 omatonBuilderFactory]: Interpolants [2752#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2753#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2754#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2755#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2756#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2757#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2758#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2759#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2760#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2761#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2762#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2763#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2764#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2765#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2766#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2767#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2768#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 2769#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 2770#(not (= 40 |#Ultimate.C_memset_#amount|)), 2714#true, 2715#false, 2746#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2747#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2748#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2749#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2750#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2751#(<= |#Ultimate.C_memset_#t~loopctr5| 4)] [2018-04-13 15:15:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:04,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 15:15:04,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 15:15:04,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=399, Unknown=0, NotChecked=0, Total=702 [2018-04-13 15:15:04,342 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 27 states. [2018-04-13 15:15:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:04,615 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-04-13 15:15:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 15:15:04,616 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2018-04-13 15:15:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:04,616 INFO L225 Difference]: With dead ends: 42 [2018-04-13 15:15:04,616 INFO L226 Difference]: Without dead ends: 40 [2018-04-13 15:15:04,617 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 15:15:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-13 15:15:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-04-13 15:15:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-13 15:15:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-04-13 15:15:04,619 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-04-13 15:15:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:04,619 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-04-13 15:15:04,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 15:15:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-04-13 15:15:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 15:15:04,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:04,620 INFO L355 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:04,620 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:04,620 INFO L82 PathProgramCache]: Analyzing trace with hash -434170339, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:04,626 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:04,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:04,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 15:15:04,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:04,863 INFO L182 omatonBuilderFactory]: Interpolants [2944#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2945#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2946#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2947#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2948#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2949#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2950#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2951#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2952#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2953#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2954#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2955#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2956#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 2957#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 2958#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 2959#(not (= 40 |#Ultimate.C_memset_#amount|)), 2901#true, 2902#false, 2934#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2935#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2936#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2937#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2938#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2939#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2940#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2941#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2942#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2943#(<= |#Ultimate.C_memset_#t~loopctr5| 8)] [2018-04-13 15:15:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:04,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 15:15:04,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 15:15:04,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=428, Unknown=0, NotChecked=0, Total=756 [2018-04-13 15:15:04,863 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2018-04-13 15:15:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:05,248 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-04-13 15:15:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 15:15:05,248 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-04-13 15:15:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:05,249 INFO L225 Difference]: With dead ends: 43 [2018-04-13 15:15:05,249 INFO L226 Difference]: Without dead ends: 41 [2018-04-13 15:15:05,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 15:15:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-13 15:15:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-04-13 15:15:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-13 15:15:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-04-13 15:15:05,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-04-13 15:15:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:05,251 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-04-13 15:15:05,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 15:15:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-04-13 15:15:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 15:15:05,251 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:05,251 INFO L355 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:05,251 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1158655976, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:05,257 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:05,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:05,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 15:15:05,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:05,462 INFO L182 omatonBuilderFactory]: Interpolants [3136#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3137#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3138#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3139#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3140#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3141#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3142#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3143#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3144#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3145#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3146#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3147#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3148#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3149#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3150#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3151#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3152#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3153#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3154#(not (= 40 |#Ultimate.C_memset_#amount|)), 3094#true, 3095#false, 3128#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3129#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3130#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3131#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3132#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3133#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3134#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3135#(<= |#Ultimate.C_memset_#t~loopctr5| 6)] [2018-04-13 15:15:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:05,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 15:15:05,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 15:15:05,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=458, Unknown=0, NotChecked=0, Total=812 [2018-04-13 15:15:05,463 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 29 states. [2018-04-13 15:15:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:05,767 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-04-13 15:15:05,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 15:15:05,768 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-04-13 15:15:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:05,768 INFO L225 Difference]: With dead ends: 44 [2018-04-13 15:15:05,768 INFO L226 Difference]: Without dead ends: 42 [2018-04-13 15:15:05,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 15:15:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-13 15:15:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-04-13 15:15:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-13 15:15:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-04-13 15:15:05,770 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-04-13 15:15:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:05,770 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-04-13 15:15:05,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 15:15:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-04-13 15:15:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 15:15:05,770 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:05,770 INFO L355 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:05,771 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2142874243, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:05,776 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:05,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:05,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 15:15:06,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:06,000 INFO L182 omatonBuilderFactory]: Interpolants [3328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3329#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3330#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3331#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3332#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3333#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3334#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3335#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3336#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3337#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3338#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3339#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3340#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3341#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3342#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3343#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3344#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3345#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3346#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3347#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3348#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3349#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3350#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3351#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3352#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3353#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3354#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3355#(not (= 40 |#Ultimate.C_memset_#amount|)), 3293#true, 3294#false] [2018-04-13 15:15:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:06,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 15:15:06,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 15:15:06,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=489, Unknown=0, NotChecked=0, Total=870 [2018-04-13 15:15:06,001 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 30 states. [2018-04-13 15:15:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:06,337 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-04-13 15:15:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 15:15:06,337 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-04-13 15:15:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:06,338 INFO L225 Difference]: With dead ends: 45 [2018-04-13 15:15:06,338 INFO L226 Difference]: Without dead ends: 43 [2018-04-13 15:15:06,338 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 15:15:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-13 15:15:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-13 15:15:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-13 15:15:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-04-13 15:15:06,340 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-04-13 15:15:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:06,340 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-04-13 15:15:06,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 15:15:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-04-13 15:15:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 15:15:06,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:06,341 INFO L355 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:06,341 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1706097848, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:06,343 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:06,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:06,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 15:15:06,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:06,584 INFO L182 omatonBuilderFactory]: Interpolants [3534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3535#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3536#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3537#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3538#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3539#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3540#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3541#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3542#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3543#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3544#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3545#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3546#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3547#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3548#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3549#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3550#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3551#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3552#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3553#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3554#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3555#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3556#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3557#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3558#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3559#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3560#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3561#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 3498#true, 3562#(not (= 40 |#Ultimate.C_memset_#amount|)), 3499#false] [2018-04-13 15:15:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:06,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 15:15:06,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 15:15:06,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=521, Unknown=0, NotChecked=0, Total=930 [2018-04-13 15:15:06,584 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 31 states. [2018-04-13 15:15:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:06,955 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-04-13 15:15:06,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 15:15:06,955 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2018-04-13 15:15:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:06,955 INFO L225 Difference]: With dead ends: 46 [2018-04-13 15:15:06,955 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 15:15:06,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 15:15:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 15:15:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-04-13 15:15:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-13 15:15:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-04-13 15:15:06,957 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-04-13 15:15:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:06,957 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-04-13 15:15:06,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 15:15:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-04-13 15:15:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 15:15:06,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:06,958 INFO L355 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:06,958 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:06,958 INFO L82 PathProgramCache]: Analyzing trace with hash 765148381, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:06,960 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:07,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:07,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 15:15:07,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:07,207 INFO L182 omatonBuilderFactory]: Interpolants [3746#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3747#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3748#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3749#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3750#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3751#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3752#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3753#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3754#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3755#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3756#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3757#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3758#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3759#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3760#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3761#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3762#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3763#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3764#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3765#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3766#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3767#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3768#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3769#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3770#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3771#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3772#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3709#true, 3773#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 3710#false, 3774#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 3775#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:07,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 15:15:07,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 15:15:07,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=554, Unknown=0, NotChecked=0, Total=992 [2018-04-13 15:15:07,208 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 32 states. [2018-04-13 15:15:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:07,629 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-04-13 15:15:07,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 15:15:07,629 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2018-04-13 15:15:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:07,630 INFO L225 Difference]: With dead ends: 47 [2018-04-13 15:15:07,630 INFO L226 Difference]: Without dead ends: 45 [2018-04-13 15:15:07,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 15:15:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-13 15:15:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-04-13 15:15:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-13 15:15:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-04-13 15:15:07,632 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-04-13 15:15:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:07,632 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-04-13 15:15:07,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 15:15:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-04-13 15:15:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 15:15:07,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:07,633 INFO L355 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:07,633 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1660485976, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:07,636 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:07,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:07,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 15:15:07,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:07,880 INFO L182 omatonBuilderFactory]: Interpolants [3968#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3969#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3970#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3971#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3972#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3973#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3974#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3975#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3976#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3977#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3978#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3979#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3980#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3981#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3982#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3983#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3984#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3985#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3986#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3987#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3988#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3989#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3926#true, 3990#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3927#false, 3991#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 3992#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 3993#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 3994#(not (= 40 |#Ultimate.C_memset_#amount|)), 3964#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3965#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3966#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3967#(<= |#Ultimate.C_memset_#t~loopctr5| 2)] [2018-04-13 15:15:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:07,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 15:15:07,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 15:15:07,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=588, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 15:15:07,881 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 33 states. [2018-04-13 15:15:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:08,306 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-04-13 15:15:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 15:15:08,306 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2018-04-13 15:15:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:08,306 INFO L225 Difference]: With dead ends: 48 [2018-04-13 15:15:08,306 INFO L226 Difference]: Without dead ends: 46 [2018-04-13 15:15:08,307 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 15:15:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-13 15:15:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-13 15:15:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 15:15:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-04-13 15:15:08,309 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-04-13 15:15:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:08,309 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-04-13 15:15:08,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 15:15:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-04-13 15:15:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 15:15:08,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:08,310 INFO L355 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:08,310 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash -648819651, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:08,313 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:08,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:08,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 15:15:08,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:08,580 INFO L182 omatonBuilderFactory]: Interpolants [4188#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4189#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4190#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4191#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4192#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4193#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4194#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4195#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4196#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4197#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4198#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4199#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4200#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4201#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4202#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4203#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4204#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4205#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 4206#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4207#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4208#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4209#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4210#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4211#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4212#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4149#true, 4213#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4150#false, 4214#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4215#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4216#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4217#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4218#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4219#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:08,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 15:15:08,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 15:15:08,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=623, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 15:15:08,581 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 34 states. [2018-04-13 15:15:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:09,009 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-04-13 15:15:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 15:15:09,009 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2018-04-13 15:15:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:09,010 INFO L225 Difference]: With dead ends: 49 [2018-04-13 15:15:09,010 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 15:15:09,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 15:15:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 15:15:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 15:15:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 15:15:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-04-13 15:15:09,012 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-04-13 15:15:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:09,012 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-04-13 15:15:09,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 15:15:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-04-13 15:15:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 15:15:09,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:09,013 INFO L355 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:09,013 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:09,013 INFO L82 PathProgramCache]: Analyzing trace with hash 777149944, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:09,015 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:09,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:09,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 15:15:09,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:09,309 INFO L182 omatonBuilderFactory]: Interpolants [4418#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4419#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4420#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4421#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4422#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4423#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4424#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4425#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4426#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4427#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4428#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4429#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4430#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4431#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4432#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4433#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4434#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4435#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 4436#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4437#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4438#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4439#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4440#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4441#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4378#true, 4442#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4379#false, 4443#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4444#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4445#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4446#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4447#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4448#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4449#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 4450#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 15:15:09,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 15:15:09,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=659, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 15:15:09,310 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 35 states. [2018-04-13 15:15:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:09,764 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-04-13 15:15:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 15:15:09,765 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-04-13 15:15:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:09,765 INFO L225 Difference]: With dead ends: 50 [2018-04-13 15:15:09,765 INFO L226 Difference]: Without dead ends: 48 [2018-04-13 15:15:09,766 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 15:15:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-13 15:15:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-13 15:15:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-13 15:15:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-04-13 15:15:09,767 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-04-13 15:15:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:09,767 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-04-13 15:15:09,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 15:15:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-04-13 15:15:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 15:15:09,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:09,767 INFO L355 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:09,767 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2032534429, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:09,770 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:10,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:10,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 15:15:10,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:10,071 INFO L182 omatonBuilderFactory]: Interpolants [4672#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4673#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4674#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4675#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4676#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4613#true, 4677#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4614#false, 4678#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4679#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4680#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4681#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4682#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4683#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4684#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4685#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 4686#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 4687#(not (= 40 |#Ultimate.C_memset_#amount|)), 4654#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4655#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4656#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4657#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4658#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4659#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4660#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4661#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4662#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4663#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4664#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4665#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4666#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4667#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4668#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4669#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4670#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4671#(<= |#Ultimate.C_memset_#t~loopctr5| 16)] [2018-04-13 15:15:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:10,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 15:15:10,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 15:15:10,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=696, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 15:15:10,072 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 36 states. [2018-04-13 15:15:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:10,490 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-04-13 15:15:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 15:15:10,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-04-13 15:15:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:10,491 INFO L225 Difference]: With dead ends: 51 [2018-04-13 15:15:10,491 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 15:15:10,492 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 15:15:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 15:15:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 15:15:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 15:15:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-04-13 15:15:10,493 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-04-13 15:15:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:10,494 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-04-13 15:15:10,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 15:15:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-04-13 15:15:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 15:15:10,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:10,494 INFO L355 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:10,494 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:10,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219496, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:10,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:10,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:10,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 15:15:10,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:10,799 INFO L182 omatonBuilderFactory]: Interpolants [4928#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 4929#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 4930#(not (= 40 |#Ultimate.C_memset_#amount|)), 4896#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4897#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4898#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4899#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4900#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4901#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4902#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4903#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4904#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4905#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4906#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4907#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4908#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4909#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4910#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4911#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4912#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4913#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 4914#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4915#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4916#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4917#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4854#true, 4918#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4855#false, 4919#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4920#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4921#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4922#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4923#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4924#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4925#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4926#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4927#(<= |#Ultimate.C_memset_#t~loopctr5| 30)] [2018-04-13 15:15:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:10,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 15:15:10,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 15:15:10,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=734, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 15:15:10,800 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 37 states. [2018-04-13 15:15:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:11,230 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-04-13 15:15:11,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 15:15:11,230 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-04-13 15:15:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:11,231 INFO L225 Difference]: With dead ends: 52 [2018-04-13 15:15:11,231 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 15:15:11,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 15:15:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 15:15:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 15:15:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 15:15:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-04-13 15:15:11,232 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-04-13 15:15:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:11,232 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-04-13 15:15:11,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 15:15:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-04-13 15:15:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 15:15:11,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:11,232 INFO L355 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:11,233 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:11,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1833427709, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:11,235 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:11,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:11,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 15:15:11,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:11,565 INFO L182 omatonBuilderFactory]: Interpolants [5144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5145#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5146#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5147#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5148#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5149#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5150#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5151#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5152#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5153#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5154#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5155#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5156#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5157#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5158#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5159#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5160#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5161#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5162#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5163#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5164#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5101#true, 5165#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5102#false, 5166#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5167#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5168#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5169#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5170#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5171#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 5172#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5173#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5174#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5175#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5176#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5177#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5178#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5179#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:11,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 15:15:11,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 15:15:11,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=773, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 15:15:11,566 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 38 states. [2018-04-13 15:15:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:12,092 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-13 15:15:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 15:15:12,092 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 49 [2018-04-13 15:15:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:12,093 INFO L225 Difference]: With dead ends: 53 [2018-04-13 15:15:12,093 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 15:15:12,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 15:15:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 15:15:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 15:15:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 15:15:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-04-13 15:15:12,094 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-04-13 15:15:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:12,094 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-04-13 15:15:12,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 15:15:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-04-13 15:15:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 15:15:12,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:12,095 INFO L355 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:12,095 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash 417406776, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:12,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:12,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:12,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 15:15:12,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:12,432 INFO L182 omatonBuilderFactory]: Interpolants [5398#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5399#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5400#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5401#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5402#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5403#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5404#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5405#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5406#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5407#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5408#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5409#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5410#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5411#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5412#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5413#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5414#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5415#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5416#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5417#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5354#true, 5418#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5355#false, 5419#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5420#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5421#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5422#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5423#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5424#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5425#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 5426#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5427#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5428#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5429#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5430#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5431#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5432#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5433#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 5434#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:12,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 15:15:12,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 15:15:12,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=813, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 15:15:12,432 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 39 states. [2018-04-13 15:15:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:12,964 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-04-13 15:15:12,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 15:15:12,964 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2018-04-13 15:15:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:12,965 INFO L225 Difference]: With dead ends: 54 [2018-04-13 15:15:12,965 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 15:15:12,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 15:15:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 15:15:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 15:15:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 15:15:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-04-13 15:15:12,966 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-04-13 15:15:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:12,966 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-04-13 15:15:12,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 15:15:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-04-13 15:15:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-13 15:15:12,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:12,967 INFO L355 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:12,967 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -529569187, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:12,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:13,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:13,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 15:15:13,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:13,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-04-13 15:15:13,331 INFO L182 omatonBuilderFactory]: Interpolants [5658#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5659#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5660#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5661#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5662#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5663#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5664#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5665#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5666#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5667#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5668#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5669#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5670#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5671#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5672#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5673#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5674#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5675#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5676#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5613#true, 5677#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5614#false, 5678#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5679#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5680#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5681#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5682#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5683#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5684#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5685#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 5686#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5687#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5688#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5689#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5690#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5691#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5692#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5693#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 5694#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 5695#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:13,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 15:15:13,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 15:15:13,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=854, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 15:15:13,332 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 40 states. [2018-04-13 15:15:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:13,883 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-04-13 15:15:13,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 15:15:13,884 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 51 [2018-04-13 15:15:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:13,884 INFO L225 Difference]: With dead ends: 55 [2018-04-13 15:15:13,884 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 15:15:13,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 15:15:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 15:15:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-13 15:15:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 15:15:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-04-13 15:15:13,886 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-04-13 15:15:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:13,886 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-04-13 15:15:13,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 15:15:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-04-13 15:15:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 15:15:13,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:13,886 INFO L355 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:13,887 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:13,887 INFO L82 PathProgramCache]: Analyzing trace with hash 178947032, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:13,889 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:14,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:14,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 15:15:14,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:14,292 INFO L182 omatonBuilderFactory]: Interpolants [5952#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5953#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5954#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5955#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5956#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5957#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5958#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5959#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 5960#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 5961#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 5962#(not (= 40 |#Ultimate.C_memset_#amount|)), 5924#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5925#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5926#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5927#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5928#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5929#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5930#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5931#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5932#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5933#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5934#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5935#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5936#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5937#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5938#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5939#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5940#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5941#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5878#true, 5942#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5879#false, 5943#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5944#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5945#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5946#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5947#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5948#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5949#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5950#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5951#(<= |#Ultimate.C_memset_#t~loopctr5| 26)] [2018-04-13 15:15:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:14,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 15:15:14,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 15:15:14,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=896, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 15:15:14,292 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 41 states. [2018-04-13 15:15:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:14,817 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-04-13 15:15:14,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 15:15:14,818 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 52 [2018-04-13 15:15:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:14,818 INFO L225 Difference]: With dead ends: 56 [2018-04-13 15:15:14,818 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 15:15:14,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 15:15:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 15:15:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 15:15:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 15:15:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-04-13 15:15:14,820 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-04-13 15:15:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:14,820 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-04-13 15:15:14,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 15:15:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-04-13 15:15:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 15:15:14,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:14,821 INFO L355 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:14,821 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash 668113341, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:14,823 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:15,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:15,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 15:15:15,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:15,219 INFO L182 omatonBuilderFactory]: Interpolants [6208#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 6209#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 6210#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 6211#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 6212#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 6149#true, 6213#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 6150#false, 6214#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 6215#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 6216#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 6217#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 6218#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 6219#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 6220#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 6221#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 6222#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 6223#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 6224#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 6225#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 6226#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 6227#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 6228#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 6229#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 6230#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 6231#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 6232#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 6233#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 6234#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 6235#(not (= 40 |#Ultimate.C_memset_#amount|)), 6196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 6197#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 6198#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 6199#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 6200#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 6201#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 6202#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 6203#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 6204#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 6205#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 6206#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 6207#(<= |#Ultimate.C_memset_#t~loopctr5| 10)] [2018-04-13 15:15:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:15,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 15:15:15,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 15:15:15,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=939, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 15:15:15,220 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 42 states. [2018-04-13 15:15:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:15,788 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-04-13 15:15:15,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 15:15:15,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 53 [2018-04-13 15:15:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:15,789 INFO L225 Difference]: With dead ends: 57 [2018-04-13 15:15:15,789 INFO L226 Difference]: Without dead ends: 55 [2018-04-13 15:15:15,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 15:15:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-13 15:15:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-13 15:15:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 15:15:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-04-13 15:15:15,790 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-04-13 15:15:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:15,791 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-04-13 15:15:15,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 15:15:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-04-13 15:15:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 15:15:15,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:15,791 INFO L355 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:15,791 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1347600264, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:15,794 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:16,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:16,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 15:15:16,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:16,195 INFO L182 omatonBuilderFactory]: Interpolants [6474#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 6475#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 6476#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 6477#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 6478#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 6479#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 6480#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 6481#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 6482#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 6483#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 6484#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 6485#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 6486#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 6487#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 6488#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 6489#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 6426#true, 6490#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 6427#false, 6491#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 6492#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 6493#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 6494#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 6495#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 6496#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 6497#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 6498#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 6499#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 6500#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 6501#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 6502#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 6503#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 6504#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 6505#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 6506#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 6507#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 6508#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 6509#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 6510#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 6511#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 6512#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 6513#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 6514#(not (= 40 |#Ultimate.C_memset_#amount|))] [2018-04-13 15:15:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:16,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 15:15:16,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 15:15:16,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=983, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 15:15:16,195 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 43 states. [2018-04-13 15:15:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:16,832 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-04-13 15:15:16,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 15:15:16,833 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 54 [2018-04-13 15:15:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:16,833 INFO L225 Difference]: With dead ends: 58 [2018-04-13 15:15:16,833 INFO L226 Difference]: Without dead ends: 56 [2018-04-13 15:15:16,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 15:15:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-13 15:15:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-04-13 15:15:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 15:15:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-04-13 15:15:16,834 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-04-13 15:15:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:16,834 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-04-13 15:15:16,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 15:15:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-04-13 15:15:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-13 15:15:16,835 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:16,835 INFO L355 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:16,835 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash 589787421, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:16,837 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:17,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 15:15:17,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 15:15:17,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 15:15:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:17,292 INFO L182 omatonBuilderFactory]: Interpolants [6784#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 6785#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 6786#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 6787#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 6788#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 6789#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 6790#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 6791#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 6792#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 6793#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 6794#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 6795#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 6796#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 6797#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 6798#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 6799#(not (= 40 |#Ultimate.C_memset_#amount|)), 6758#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 6759#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 6760#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 6761#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 6762#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 6763#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 6764#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 6765#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 6766#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 6767#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 6768#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 6769#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 6770#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 6771#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 6772#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 6709#true, 6773#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 6710#false, 6774#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 6775#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 6776#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 6777#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 6778#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 6779#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 6780#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 6781#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 6782#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 6783#(<= |#Ultimate.C_memset_#t~loopctr5| 24)] [2018-04-13 15:15:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 15:15:17,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 15:15:17,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 15:15:17,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=1028, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 15:15:17,293 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 44 states. [2018-04-13 15:15:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 15:15:17,911 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-04-13 15:15:17,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 15:15:17,911 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-04-13 15:15:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 15:15:17,911 INFO L225 Difference]: With dead ends: 59 [2018-04-13 15:15:17,911 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 15:15:17,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 15:15:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 15:15:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 15:15:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 15:15:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-04-13 15:15:17,913 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-04-13 15:15:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 15:15:17,913 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-04-13 15:15:17,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 15:15:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-04-13 15:15:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 15:15:17,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 15:15:17,913 INFO L355 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 15:15:17,913 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 15:15:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash 519263512, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 15:15:17,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 15:15:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 15:15:17,933 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-04-13 15:15:17,935 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (array-ext (Array Int Int) (Array Int Int)) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.createTerm(Parser.java:802) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1304) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseInterpolants(Executor.java:255) at de.uni_freiburg.informatik.ultimate.smtsolver.external.ScriptorWithGetInterpolants.readInterpolants(ScriptorWithGetInterpolants.java:136) at de.uni_freiburg.informatik.ultimate.smtsolver.external.ScriptorWithGetInterpolants.getInterpolants(ScriptorWithGetInterpolants.java:64) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.getInterpolants(DiffWrapperScript.java:260) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:298) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-13 15:15:17,937 INFO L168 Benchmark]: Toolchain (without parser) took 20839.19 ms. Allocated memory was 404.8 MB in the beginning and 803.2 MB in the end (delta: 398.5 MB). Free memory was 344.9 MB in the beginning and 497.6 MB in the end (delta: -152.7 MB). Peak memory consumption was 245.8 MB. Max. memory is 5.3 GB. [2018-04-13 15:15:17,938 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 404.8 MB. Free memory is still 365.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 15:15:17,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.18 ms. Allocated memory is still 404.8 MB. Free memory was 344.9 MB in the beginning and 335.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-04-13 15:15:17,938 INFO L168 Benchmark]: Boogie Preprocessor took 20.42 ms. Allocated memory is still 404.8 MB. Free memory was 335.6 MB in the beginning and 334.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 15:15:17,938 INFO L168 Benchmark]: RCFGBuilder took 179.60 ms. Allocated memory was 404.8 MB in the beginning and 599.8 MB in the end (delta: 195.0 MB). Free memory was 334.3 MB in the beginning and 569.3 MB in the end (delta: -235.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. [2018-04-13 15:15:17,939 INFO L168 Benchmark]: TraceAbstraction took 20493.35 ms. Allocated memory was 599.8 MB in the beginning and 803.2 MB in the end (delta: 203.4 MB). Free memory was 568.0 MB in the beginning and 497.6 MB in the end (delta: 70.4 MB). Peak memory consumption was 273.8 MB. Max. memory is 5.3 GB. [2018-04-13 15:15:17,940 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.20 ms. Allocated memory is still 404.8 MB. Free memory is still 365.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 142.18 ms. Allocated memory is still 404.8 MB. Free memory was 344.9 MB in the beginning and 335.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.42 ms. Allocated memory is still 404.8 MB. Free memory was 335.6 MB in the beginning and 334.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 179.60 ms. Allocated memory was 404.8 MB in the beginning and 599.8 MB in the end (delta: 195.0 MB). Free memory was 334.3 MB in the beginning and 569.3 MB in the end (delta: -235.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20493.35 ms. Allocated memory was 599.8 MB in the beginning and 803.2 MB in the end (delta: 203.4 MB). Free memory was 568.0 MB in the beginning and 497.6 MB in the end (delta: 70.4 MB). Peak memory consumption was 273.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (array-ext (Array Int Int) (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (array-ext (Array Int Int) (Array Int Int)): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memsetNonZero2_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_15-15-17-946.csv Received shutdown request...