./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2749915c63b6e758ac6033a38fbdad80769d2869 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:02:06,395 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:02:06,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:02:06,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:02:06,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:02:06,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:02:06,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:02:06,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:02:06,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:02:06,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:02:06,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:02:06,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:02:06,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:02:06,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:02:06,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:02:06,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:02:06,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:02:06,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:02:06,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:02:06,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:02:06,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:02:06,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:02:06,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:02:06,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:02:06,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:02:06,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:02:06,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:02:06,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:02:06,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:02:06,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:02:06,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:02:06,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:02:06,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:02:06,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:02:06,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:02:06,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:02:06,446 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 23:02:06,462 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:02:06,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:02:06,464 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:02:06,464 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:02:06,464 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:02:06,465 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:02:06,465 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:02:06,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:02:06,466 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:02:06,466 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:02:06,466 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:02:06,466 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:02:06,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:02:06,467 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:02:06,467 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:02:06,467 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 23:02:06,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:02:06,468 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:02:06,468 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:02:06,468 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:02:06,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:02:06,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:02:06,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:02:06,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:06,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:02:06,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:02:06,470 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:02:06,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:02:06,471 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2749915c63b6e758ac6033a38fbdad80769d2869 [2018-11-28 23:02:06,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:02:06,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:02:06,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:02:06,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:02:06,559 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:02:06,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c [2018-11-28 23:02:06,629 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6d7ca25/5d799096df68481195260a79605115a0/FLAG0d1e90ce6 [2018-11-28 23:02:07,082 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:02:07,082 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c [2018-11-28 23:02:07,090 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6d7ca25/5d799096df68481195260a79605115a0/FLAG0d1e90ce6 [2018-11-28 23:02:07,394 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6d7ca25/5d799096df68481195260a79605115a0 [2018-11-28 23:02:07,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:02:07,399 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:02:07,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:07,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:02:07,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:02:07,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fa4cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07, skipping insertion in model container [2018-11-28 23:02:07,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:02:07,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:02:07,641 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:07,658 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:02:07,679 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:07,699 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:02:07,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07 WrapperNode [2018-11-28 23:02:07,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:07,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:02:07,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:02:07,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:02:07,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... [2018-11-28 23:02:07,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:02:07,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:02:07,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:02:07,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:02:07,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (1/1) ... No working directory specified, using /storage/repos/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-11-28 23:02:07,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:02:07,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:02:07,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:02:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 23:02:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 23:02:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-28 23:02:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:02:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:02:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:02:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:02:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:02:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:02:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:02:08,372 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:02:08,372 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:02:08,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:08 BoogieIcfgContainer [2018-11-28 23:02:08,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:02:08,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:02:08,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:02:08,377 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:02:08,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:02:07" (1/3) ... [2018-11-28 23:02:08,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f548c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:08, skipping insertion in model container [2018-11-28 23:02:08,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:07" (2/3) ... [2018-11-28 23:02:08,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f548c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:08, skipping insertion in model container [2018-11-28 23:02:08,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:08" (3/3) ... [2018-11-28 23:02:08,381 INFO L112 eAbstractionObserver]: Analyzing ICFG freeAlloca_false-valid-free.c [2018-11-28 23:02:08,392 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:02:08,402 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-28 23:02:08,420 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-28 23:02:08,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:08,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:08,449 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:08,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:08,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:08,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:08,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:08,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:08,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-28 23:02:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:08,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,481 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:08,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1804436064, now seen corresponding path program 1 times [2018-11-28 23:02:08,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:08,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:08,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 23:02:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:02:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:02:08,630 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-28 23:02:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,647 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-28 23:02:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:02:08,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-28 23:02:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,657 INFO L225 Difference]: With dead ends: 26 [2018-11-28 23:02:08,657 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 23:02:08,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:02:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 23:02:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 23:02:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:02:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-28 23:02:08,696 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 8 [2018-11-28 23:02:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,697 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-28 23:02:08,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 23:02:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-28 23:02:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:08,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,698 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:08,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1804435754, now seen corresponding path program 1 times [2018-11-28 23:02:08,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:08,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:08,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:08,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:08,793 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2018-11-28 23:02:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,883 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-28 23:02:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:08,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,885 INFO L225 Difference]: With dead ends: 29 [2018-11-28 23:02:08,885 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 23:02:08,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 23:02:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-28 23:02:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:02:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-28 23:02:08,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2018-11-28 23:02:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,892 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-28 23:02:08,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-28 23:02:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:08,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,894 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:08,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1804435808, now seen corresponding path program 1 times [2018-11-28 23:02:08,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,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-11-28 23:02:09,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:09,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:09,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:09,045 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-28 23:02:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,147 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-28 23:02:09,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:09,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,148 INFO L225 Difference]: With dead ends: 28 [2018-11-28 23:02:09,149 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 23:02:09,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 23:02:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-28 23:02:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:02:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 23:02:09,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 8 [2018-11-28 23:02:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,155 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 23:02:09,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-28 23:02:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:09,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,157 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:09,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1804435807, now seen corresponding path program 1 times [2018-11-28 23:02:09,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:09,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:09,210 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2018-11-28 23:02:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,285 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-28 23:02:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:09,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,287 INFO L225 Difference]: With dead ends: 23 [2018-11-28 23:02:09,287 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 23:02:09,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 23:02:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-28 23:02:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:02:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-28 23:02:09,294 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 8 [2018-11-28 23:02:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,294 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-28 23:02:09,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-28 23:02:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:09,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,296 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:09,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash -65428114, now seen corresponding path program 1 times [2018-11-28 23:02:09,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:09,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:09,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:09,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:09,388 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2018-11-28 23:02:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,432 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-28 23:02:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:09,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 23:02:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,434 INFO L225 Difference]: With dead ends: 20 [2018-11-28 23:02:09,434 INFO L226 Difference]: Without dead ends: 20 [2018-11-28 23:02:09,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-28 23:02:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 23:02:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:02:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-28 23:02:09,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2018-11-28 23:02:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,439 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-28 23:02:09,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-28 23:02:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:09,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,441 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,441 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:09,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash -65428061, now seen corresponding path program 1 times [2018-11-28 23:02:09,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,707 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-28 23:02:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:09,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:09,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:09,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:09,711 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-28 23:02:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,840 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-28 23:02:09,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:09,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-28 23:02:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,842 INFO L225 Difference]: With dead ends: 21 [2018-11-28 23:02:09,842 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 23:02:09,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 23:02:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-28 23:02:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:02:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-28 23:02:09,847 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2018-11-28 23:02:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,847 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-28 23:02:09,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-28 23:02:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 23:02:09,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,849 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:09,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,849 INFO L82 PathProgramCache]: Analyzing trace with hash 746182456, now seen corresponding path program 1 times [2018-11-28 23:02:09,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:09,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:09,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:09,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:02:09,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:02:09,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:02:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:09,982 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-28 23:02:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,127 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-28 23:02:10,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:10,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-28 23:02:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,129 INFO L225 Difference]: With dead ends: 25 [2018-11-28 23:02:10,129 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 23:02:10,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 23:02:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-28 23:02:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:02:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-28 23:02:10,133 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-11-28 23:02:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,133 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-28 23:02:10,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:02:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-28 23:02:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 23:02:10,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,134 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:10,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:10,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash 11268501, now seen corresponding path program 2 times [2018-11-28 23:02:10,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:10,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:10,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:10,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:10,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:10,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:10,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:02:10,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2018-11-28 23:02:10,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:10,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2018-11-28 23:02:10,843 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-11-28 23:02:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:15,133 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-28 23:02:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:15,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-28 23:02:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:15,135 INFO L225 Difference]: With dead ends: 31 [2018-11-28 23:02:15,135 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 23:02:15,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2018-11-28 23:02:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 23:02:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-28 23:02:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:02:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-28 23:02:15,141 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2018-11-28 23:02:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:15,141 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-28 23:02:15,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-28 23:02:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 23:02:15,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:15,142 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:15,142 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:15,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:15,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2055690322, now seen corresponding path program 1 times [2018-11-28 23:02:15,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:15,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:15,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:15,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:15,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:15,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:15,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:15,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:15,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:02:15,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:02:15,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:02:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:15,338 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 7 states. [2018-11-28 23:02:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:15,449 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-28 23:02:15,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:15,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 23:02:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:15,450 INFO L225 Difference]: With dead ends: 33 [2018-11-28 23:02:15,450 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 23:02:15,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 23:02:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-28 23:02:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:02:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-28 23:02:15,455 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2018-11-28 23:02:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:15,455 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-28 23:02:15,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:02:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-28 23:02:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 23:02:15,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:15,458 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:15,458 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:15,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1805176373, now seen corresponding path program 2 times [2018-11-28 23:02:15,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:15,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:15,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:15,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:15,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:15,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:15,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:15,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:15,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 23:02:16,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:16,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2018-11-28 23:02:16,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:02:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:02:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2018-11-28 23:02:16,117 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 11 states. [2018-11-28 23:02:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:16,337 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-28 23:02:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:16,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-28 23:02:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:16,338 INFO L225 Difference]: With dead ends: 36 [2018-11-28 23:02:16,338 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:02:16,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=167, Unknown=1, NotChecked=0, Total=240 [2018-11-28 23:02:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:02:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:02:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:02:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:02:16,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-28 23:02:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:16,339 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:02:16,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:02:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:02:16,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:02:16,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:16 BoogieIcfgContainer [2018-11-28 23:02:16,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:16,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:16,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:16,346 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:16,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:08" (3/4) ... [2018-11-28 23:02:16,351 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:02:16,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:02:16,359 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:02:16,364 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 23:02:16,365 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 23:02:16,365 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:02:16,409 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:16,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:16,411 INFO L168 Benchmark]: Toolchain (without parser) took 9012.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.7 MB in the beginning and 951.9 MB in the end (delta: 786.1 kB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:16,412 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:16,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:16,413 INFO L168 Benchmark]: Boogie Preprocessor took 51.25 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:16,413 INFO L168 Benchmark]: RCFGBuilder took 621.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:16,414 INFO L168 Benchmark]: TraceAbstraction took 7971.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.9 MB in the end (delta: 174.0 MB). Peak memory consumption was 174.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:16,415 INFO L168 Benchmark]: Witness Printer took 64.04 ms. Allocated memory is still 1.2 GB. Free memory is still 951.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:16,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.25 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 621.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7971.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.9 MB in the end (delta: 174.0 MB). Peak memory consumption was 174.0 MB. Max. memory is 11.5 GB. * Witness Printer took 64.04 ms. Allocated memory is still 1.2 GB. Free memory is still 951.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 7 error locations. SAFE Result, 7.9s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 155 SDtfs, 101 SDslu, 211 SDs, 0 SdLazy, 215 SolverSat, 16 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 232 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 218 ConstructedInterpolants, 2 QuantifiedInterpolants, 20095 SizeOfPredicates, 4 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 37/103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...