./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/scopes3_false-valid-deref.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/scopes3_false-valid-deref.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 7efcb16e512d7de15a71f6cd895dcd8493c4b646 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:02:03,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:02:03,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:02:03,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:02:03,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:02:03,344 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:02:03,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:02:03,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:02:03,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:02:03,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:02:03,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:02:03,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:02:03,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:02:03,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:02:03,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:02:03,367 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:02:03,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:02:03,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:02:03,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:02:03,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:02:03,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:02:03,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:02:03,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:02:03,378 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:02:03,378 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:02:03,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:02:03,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:02:03,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:02:03,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:02:03,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:02:03,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:02:03,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:02:03,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:02:03,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:02:03,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:02:03,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:02:03,385 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:03,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:02:03,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:02:03,401 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:02:03,401 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:02:03,402 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:02:03,402 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:02:03,402 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:02:03,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:02:03,403 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:02:03,403 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:02:03,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:02:03,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:02:03,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:02:03,404 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:02:03,404 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:02:03,404 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 23:02:03,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:02:03,404 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:02:03,405 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:02:03,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:02:03,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:02:03,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:02:03,405 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:02:03,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:03,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:02:03,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:02:03,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:02:03,406 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:02:03,407 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 -> 7efcb16e512d7de15a71f6cd895dcd8493c4b646 [2018-11-28 23:02:03,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:02:03,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:02:03,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:02:03,474 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:02:03,474 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:02:03,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/scopes3_false-valid-deref.c [2018-11-28 23:02:03,550 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888a77199/42bf4300328e43079050ccd657367e05/FLAG46885ce82 [2018-11-28 23:02:04,027 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:02:04,028 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/scopes3_false-valid-deref.c [2018-11-28 23:02:04,035 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888a77199/42bf4300328e43079050ccd657367e05/FLAG46885ce82 [2018-11-28 23:02:04,377 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888a77199/42bf4300328e43079050ccd657367e05 [2018-11-28 23:02:04,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:02:04,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:02:04,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:04,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:02:04,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:02:04,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:04" (1/1) ... [2018-11-28 23:02:04,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427b1d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:04, skipping insertion in model container [2018-11-28 23:02:04,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:04" (1/1) ... [2018-11-28 23:02:04,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:02:04,420 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:02:04,621 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:04,647 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:02:04,670 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:04,692 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:02:04,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:04 WrapperNode [2018-11-28 23:02:04,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:04,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:02:04,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:02:04,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:02:04,711 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:04" (1/1) ... [2018-11-28 23:02:04,711 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:04" (1/1) ... [2018-11-28 23:02:04,720 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:04" (1/1) ... [2018-11-28 23:02:04,720 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:04" (1/1) ... [2018-11-28 23:02:04,729 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:04" (1/1) ... [2018-11-28 23:02:04,736 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:04" (1/1) ... [2018-11-28 23:02:04,738 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:04" (1/1) ... [2018-11-28 23:02:04,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:02:04,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:02:04,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:02:04,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:02:04,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:04" (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:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:02:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:02:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:02:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:02:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:02:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:02:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:02:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:02:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:02:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:02:05,293 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:02:05,293 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:02:05,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:05 BoogieIcfgContainer [2018-11-28 23:02:05,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:02:05,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:02:05,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:02:05,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:02:05,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:02:04" (1/3) ... [2018-11-28 23:02:05,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a84cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:05, skipping insertion in model container [2018-11-28 23:02:05,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:04" (2/3) ... [2018-11-28 23:02:05,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a84cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:05, skipping insertion in model container [2018-11-28 23:02:05,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:05" (3/3) ... [2018-11-28 23:02:05,301 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes3_false-valid-deref.c [2018-11-28 23:02:05,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:02:05,354 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-28 23:02:05,381 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-28 23:02:05,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:05,425 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:05,425 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:05,425 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:05,426 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:05,426 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:05,426 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:05,426 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:05,426 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-28 23:02:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:05,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:05,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:05,461 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:05,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -197094901, now seen corresponding path program 1 times [2018-11-28 23:02:05,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:05,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:05,587 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:05,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:05,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:05,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 23:02:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:02:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:02:05,612 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-28 23:02:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:05,634 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-28 23:02:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:02:05,636 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-28 23:02:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:05,646 INFO L225 Difference]: With dead ends: 20 [2018-11-28 23:02:05,646 INFO L226 Difference]: Without dead ends: 17 [2018-11-28 23:02:05,648 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:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-28 23:02:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 23:02:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:02:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-28 23:02:05,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2018-11-28 23:02:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:05,689 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-28 23:02:05,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 23:02:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-28 23:02:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:05,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:05,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:05,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:05,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:05,691 INFO L82 PathProgramCache]: Analyzing trace with hash -197095180, now seen corresponding path program 1 times [2018-11-28 23:02:05,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:05,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:05,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:05,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:05,779 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:05,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:05,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:05,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:05,783 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-28 23:02:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:05,819 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-28 23:02:05,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:05,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:05,822 INFO L225 Difference]: With dead ends: 22 [2018-11-28 23:02:05,822 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 23:02:05,823 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:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 23:02:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-28 23:02:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:02:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-28 23:02:05,833 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2018-11-28 23:02:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:05,833 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-28 23:02:05,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-28 23:02:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:05,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:05,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:05,834 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:05,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -197095125, now seen corresponding path program 1 times [2018-11-28 23:02:05,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:05,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:05,939 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:05,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:05,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:05,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:05,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:05,942 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2018-11-28 23:02:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:05,979 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-28 23:02:05,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:05,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:05,982 INFO L225 Difference]: With dead ends: 16 [2018-11-28 23:02:05,982 INFO L226 Difference]: Without dead ends: 16 [2018-11-28 23:02:05,983 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:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-28 23:02:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:02:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:02:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-28 23:02:05,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2018-11-28 23:02:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:05,987 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-28 23:02:05,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-28 23:02:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:05,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:05,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:05,989 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:05,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:05,989 INFO L82 PathProgramCache]: Analyzing trace with hash -197095126, now seen corresponding path program 1 times [2018-11-28 23:02:05,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:05,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:05,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:05,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:06,062 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:06,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:06,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:06,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:06,064 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-28 23:02:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:06,131 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-28 23:02:06,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:06,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:06,133 INFO L225 Difference]: With dead ends: 15 [2018-11-28 23:02:06,133 INFO L226 Difference]: Without dead ends: 15 [2018-11-28 23:02:06,133 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:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-28 23:02:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:02:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:02:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-28 23:02:06,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2018-11-28 23:02:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:06,137 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-28 23:02:06,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-28 23:02:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 23:02:06,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:06,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:06,138 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:06,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash -440617163, now seen corresponding path program 1 times [2018-11-28 23:02:06,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:06,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:06,210 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:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:06,211 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:06,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:06,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:06,333 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:06,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:06,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:02:06,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:02:06,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:02:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:06,360 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-28 23:02:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:06,409 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-28 23:02:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:06,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-28 23:02:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:06,410 INFO L225 Difference]: With dead ends: 20 [2018-11-28 23:02:06,410 INFO L226 Difference]: Without dead ends: 20 [2018-11-28 23:02:06,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-28 23:02:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-28 23:02:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:02:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-28 23:02:06,416 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2018-11-28 23:02:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:06,417 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-28 23:02:06,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:02:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-28 23:02:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:02:06,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:06,418 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:06,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:06,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1004249772, now seen corresponding path program 2 times [2018-11-28 23:02:06,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:06,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:06,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:06,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:06,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:06,609 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:06,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:06,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:06,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:06,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:06,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:06,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:02:06,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:06,736 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-28 23:02:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:06,804 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-28 23:02:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:06,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 23:02:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:06,806 INFO L225 Difference]: With dead ends: 23 [2018-11-28 23:02:06,806 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 23:02:06,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 23:02:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 23:02:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:02:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-28 23:02:06,811 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-28 23:02:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:06,811 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-28 23:02:06,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-28 23:02:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 23:02:06,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:06,812 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:06,812 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:06,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1138822869, now seen corresponding path program 3 times [2018-11-28 23:02:06,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:06,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:07,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:07,020 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:07,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:02:07,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:02:07,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:07,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:07,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:07,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:02:07,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:02:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:02:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:07,124 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-11-28 23:02:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:07,260 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-28 23:02:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:07,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-28 23:02:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:07,261 INFO L225 Difference]: With dead ends: 26 [2018-11-28 23:02:07,261 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 23:02:07,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 23:02:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-28 23:02:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:02:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-28 23:02:07,266 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2018-11-28 23:02:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:07,266 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-28 23:02:07,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:02:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-28 23:02:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:02:07,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:07,268 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:07,268 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:07,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash 727015860, now seen corresponding path program 4 times [2018-11-28 23:02:07,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:07,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:07,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:07,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:07,407 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:07,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:02:07,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:02:07,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:07,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:07,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:07,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:02:07,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:07,504 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2018-11-28 23:02:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:07,559 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 23:02:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:07,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-28 23:02:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:07,562 INFO L225 Difference]: With dead ends: 29 [2018-11-28 23:02:07,562 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 23:02:07,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 23:02:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 23:02:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:02:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 23:02:07,568 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2018-11-28 23:02:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:07,568 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 23:02:07,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 23:02:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:02:07,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:07,569 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:07,570 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:07,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash -988991883, now seen corresponding path program 5 times [2018-11-28 23:02:07,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:07,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:07,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:07,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:07,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:07,781 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:02:07,893 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 23:02:07,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:07,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:08,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 23:02:08,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:02:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:02:08,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:08,060 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2018-11-28 23:02:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,257 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-28 23:02:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:08,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-28 23:02:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,263 INFO L225 Difference]: With dead ends: 32 [2018-11-28 23:02:08,263 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 23:02:08,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 23:02:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 23:02:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:02:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-28 23:02:08,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2018-11-28 23:02:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,268 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-28 23:02:08,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:02:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-28 23:02:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:02:08,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,269 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,269 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:08,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash 420060692, now seen corresponding path program 6 times [2018-11-28 23:02:08,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:08,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:08,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:08,602 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:02:08,652 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 23:02:08,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:08,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:08,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 23:02:08,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:02:08,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:02:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:08,704 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2018-11-28 23:02:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,801 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-28 23:02:08,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:02:08,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-28 23:02:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,804 INFO L225 Difference]: With dead ends: 35 [2018-11-28 23:02:08,804 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 23:02:08,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 23:02:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-28 23:02:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:02:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-28 23:02:08,809 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 26 [2018-11-28 23:02:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,809 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-28 23:02:08,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:02:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-28 23:02:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 23:02:08,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,810 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,811 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:08,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1505028587, now seen corresponding path program 7 times [2018-11-28 23:02:08,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:08,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:09,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:09,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:09,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 23:02:09,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:02:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:02:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:09,549 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2018-11-28 23:02:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,638 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-28 23:02:09,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:02:09,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-28 23:02:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,643 INFO L225 Difference]: With dead ends: 38 [2018-11-28 23:02:09,644 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 23:02:09,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 23:02:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-28 23:02:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 23:02:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-28 23:02:09,651 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-11-28 23:02:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,651 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-28 23:02:09,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:02:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-28 23:02:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 23:02:09,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,654 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,655 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:09,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1141435788, now seen corresponding path program 8 times [2018-11-28 23:02:09,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:09,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:09,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:09,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:09,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:10,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:10,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 23:02:10,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:10,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:10,043 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 12 states. [2018-11-28 23:02:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,255 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-28 23:02:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:10,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-28 23:02:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,256 INFO L225 Difference]: With dead ends: 41 [2018-11-28 23:02:10,256 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 23:02:10,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 23:02:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-28 23:02:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 23:02:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-28 23:02:10,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 32 [2018-11-28 23:02:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,262 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-28 23:02:10,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-28 23:02:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 23:02:10,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,263 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:10,264 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:10,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1255881291, now seen corresponding path program 9 times [2018-11-28 23:02:10,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:10,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:10,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:10,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:10,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:02:10,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 23:02:10,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:10,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:10,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:10,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-28 23:02:10,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:02:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:02:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:10,626 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 13 states. [2018-11-28 23:02:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,687 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-28 23:02:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:02:10,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-28 23:02:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,689 INFO L225 Difference]: With dead ends: 42 [2018-11-28 23:02:10,689 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 23:02:10,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 23:02:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 23:02:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 23:02:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-28 23:02:10,695 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 35 [2018-11-28 23:02:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,695 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-28 23:02:10,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:02:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-28 23:02:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 23:02:10,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,699 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:10,699 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:02:10,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -497828140, now seen corresponding path program 10 times [2018-11-28 23:02:10,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:10,843 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 23:02:10,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:10 BoogieIcfgContainer [2018-11-28 23:02:10,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:10,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:10,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:10,879 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:10,881 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:05" (3/4) ... [2018-11-28 23:02:10,884 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 23:02:10,995 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:10,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:11,000 INFO L168 Benchmark]: Toolchain (without parser) took 6619.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 947.3 MB in the beginning and 804.2 MB in the end (delta: 143.1 MB). Peak memory consumption was 263.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:11,004 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:11,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.01 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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:11,009 INFO L168 Benchmark]: Boogie Preprocessor took 51.94 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:11,010 INFO L168 Benchmark]: RCFGBuilder took 547.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:11,016 INFO L168 Benchmark]: TraceAbstraction took 5584.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 811.1 MB in the end (delta: 285.1 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:11,016 INFO L168 Benchmark]: Witness Printer took 120.39 ms. Allocated memory is still 1.1 GB. Free memory was 811.1 MB in the beginning and 804.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:11,026 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.01 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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.94 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 547.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5584.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 811.1 MB in the end (delta: 285.1 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. * Witness Printer took 120.39 ms. Allocated memory is still 1.1 GB. Free memory was 811.1 MB in the beginning and 804.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={45:0}, i=0, p={45:0}] [L6] p[0] = 1 VAL [a={45:0}, i=0, p={45:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={43:0}, i=1, p={43:0}] [L6] p[0] = 1 VAL [a={43:0}, i=1, p={43:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={47:0}, i=2, p={47:0}] [L6] p[0] = 1 VAL [a={47:0}, i=2, p={47:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={41:0}, i=3, p={41:0}] [L6] p[0] = 1 VAL [a={41:0}, i=3, p={41:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=4, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=4, p={51:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={48:0}, i=5, p={48:0}] [L6] p[0] = 1 VAL [a={48:0}, i=5, p={48:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={46:0}, i=6, p={46:0}] [L6] p[0] = 1 VAL [a={46:0}, i=6, p={46:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={44:0}, i=7, p={44:0}] [L6] p[0] = 1 VAL [a={44:0}, i=7, p={44:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={49:0}, i=8, p={49:0}] [L6] p[0] = 1 VAL [a={49:0}, i=8, p={49:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=9, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=9, p={51:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={51:0}] [L8] p[0] = 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 5 error locations. UNSAFE Result, 5.4s OverallTime, 14 OverallIterations, 10 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 123 SDslu, 422 SDs, 0 SdLazy, 189 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=13, 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, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 484 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 24918 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1131 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 0/810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...