./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2749915c63b6e758ac6033a38fbdad80769d2869 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 20:49:42,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:49:42,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:49:42,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:49:42,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:49:42,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:49:42,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:49:42,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:49:42,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:49:42,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:49:42,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:49:42,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:49:42,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:49:42,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:49:42,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:49:42,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:49:42,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:49:42,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:49:42,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:49:42,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:49:42,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:49:42,528 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:49:42,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:49:42,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:49:42,531 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:49:42,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:49:42,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:49:42,535 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:49:42,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:49:42,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:49:42,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:49:42,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:49:42,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:49:42,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:49:42,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:49:42,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:49:42,541 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:49:42,556 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:49:42,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:49:42,558 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:49:42,558 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:49:42,558 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:49:42,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:49:42,559 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:49:42,559 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:49:42,559 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:49:42,559 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:49:42,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:49:42,560 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:49:42,560 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:49:42,560 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:49:42,560 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:49:42,560 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:49:42,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:49:42,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:49:42,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:49:42,563 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:49:42,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:42,563 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:49:42,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:49:42,563 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:49:42,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:49:42,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2749915c63b6e758ac6033a38fbdad80769d2869 [2019-01-14 20:49:42,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:49:42,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:49:42,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:49:42,620 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:49:42,621 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:49:42,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c [2019-01-14 20:49:42,684 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e872e7c/fdd57651be7e41469b3d7e7ee6dbe222/FLAGa70ef44be [2019-01-14 20:49:43,099 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:49:43,100 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c [2019-01-14 20:49:43,106 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e872e7c/fdd57651be7e41469b3d7e7ee6dbe222/FLAGa70ef44be [2019-01-14 20:49:43,477 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e872e7c/fdd57651be7e41469b3d7e7ee6dbe222 [2019-01-14 20:49:43,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:49:43,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:49:43,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:43,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:49:43,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:49:43,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e51134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43, skipping insertion in model container [2019-01-14 20:49:43,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:49:43,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:49:43,675 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:43,687 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:49:43,701 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:43,718 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:49:43,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43 WrapperNode [2019-01-14 20:49:43,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:43,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:49:43,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:49:43,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:49:43,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (1/1) ... [2019-01-14 20:49:43,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:49:43,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:49:43,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:49:43,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:49:43,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (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 [2019-01-14 20:49:43,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:49:43,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:49:43,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:49:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 20:49:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 20:49:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-01-14 20:49:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:49:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 20:49:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:49:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:49:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:49:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:49:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:49:44,263 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:49:44,263 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 20:49:44,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:44 BoogieIcfgContainer [2019-01-14 20:49:44,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:49:44,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:49:44,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:49:44,269 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:49:44,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:49:43" (1/3) ... [2019-01-14 20:49:44,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34754096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:44, skipping insertion in model container [2019-01-14 20:49:44,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:43" (2/3) ... [2019-01-14 20:49:44,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34754096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:44, skipping insertion in model container [2019-01-14 20:49:44,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:44" (3/3) ... [2019-01-14 20:49:44,272 INFO L112 eAbstractionObserver]: Analyzing ICFG freeAlloca_false-valid-free.c [2019-01-14 20:49:44,281 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:49:44,288 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 20:49:44,302 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 20:49:44,327 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:49:44,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:49:44,328 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:49:44,328 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:49:44,328 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:49:44,328 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:49:44,328 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:49:44,328 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:49:44,328 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:49:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-14 20:49:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:44,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:44,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:44,362 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:44,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 996996062, now seen corresponding path program 1 times [2019-01-14 20:49:44,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:44,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:44,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:44,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 20:49:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 20:49:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 20:49:44,516 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-01-14 20:49:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:44,530 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-14 20:49:44,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 20:49:44,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-14 20:49:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:44,539 INFO L225 Difference]: With dead ends: 28 [2019-01-14 20:49:44,539 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 20:49:44,541 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 [2019-01-14 20:49:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 20:49:44,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 20:49:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 20:49:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-14 20:49:44,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2019-01-14 20:49:44,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:44,578 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-14 20:49:44,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 20:49:44,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-14 20:49:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:44,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:44,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:44,580 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:44,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:44,580 INFO L82 PathProgramCache]: Analyzing trace with hash 996995752, now seen corresponding path program 1 times [2019-01-14 20:49:44,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:44,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:44,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:44,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:44,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:44,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 20:49:44,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:44,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:44,675 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 3 states. [2019-01-14 20:49:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:44,813 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-14 20:49:44,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:44,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:44,815 INFO L225 Difference]: With dead ends: 31 [2019-01-14 20:49:44,816 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 20:49:44,816 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 [2019-01-14 20:49:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 20:49:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-01-14 20:49:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 20:49:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-14 20:49:44,830 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2019-01-14 20:49:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:44,831 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-14 20:49:44,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-14 20:49:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:44,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:44,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:44,834 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:44,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash 996995806, now seen corresponding path program 1 times [2019-01-14 20:49:44,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:44,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:44,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:45,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:45,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:45,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:45,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:45,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:45,018 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 3 states. [2019-01-14 20:49:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:45,185 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-14 20:49:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:45,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:45,187 INFO L225 Difference]: With dead ends: 30 [2019-01-14 20:49:45,187 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 20:49:45,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 20:49:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-14 20:49:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 20:49:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-14 20:49:45,193 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2019-01-14 20:49:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:45,194 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-14 20:49:45,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-14 20:49:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:45,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:45,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:45,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash 996995805, now seen corresponding path program 1 times [2019-01-14 20:49:45,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:45,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:45,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:45,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:45,258 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2019-01-14 20:49:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:45,383 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-01-14 20:49:45,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:45,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:45,385 INFO L225 Difference]: With dead ends: 25 [2019-01-14 20:49:45,385 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 20:49:45,386 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 [2019-01-14 20:49:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 20:49:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-14 20:49:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 20:49:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 20:49:45,394 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2019-01-14 20:49:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:45,394 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 20:49:45,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 20:49:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:45,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:45,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:45,396 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 63449068, now seen corresponding path program 1 times [2019-01-14 20:49:45,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:45,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:49:45,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:45,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:45,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:45,472 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2019-01-14 20:49:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:45,514 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-01-14 20:49:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:45,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 20:49:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:45,516 INFO L225 Difference]: With dead ends: 22 [2019-01-14 20:49:45,516 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 20:49:45,517 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 [2019-01-14 20:49:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 20:49:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 20:49:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 20:49:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-01-14 20:49:45,522 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2019-01-14 20:49:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:45,522 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-14 20:49:45,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-01-14 20:49:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:45,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:45,524 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:45,525 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash 63449121, now seen corresponding path program 1 times [2019-01-14 20:49:45,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:45,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:45,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:49:45,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:45,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:45,779 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2019-01-14 20:49:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:45,868 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-14 20:49:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:49:45,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-14 20:49:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:45,870 INFO L225 Difference]: With dead ends: 23 [2019-01-14 20:49:45,870 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 20:49:45,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 20:49:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-01-14 20:49:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 20:49:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-14 20:49:45,877 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2019-01-14 20:49:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:45,878 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 20:49:45,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-14 20:49:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 20:49:45,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:45,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:45,879 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 425550780, now seen corresponding path program 1 times [2019-01-14 20:49:45,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:45,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:45,950 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 [2019-01-14 20:49:45,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:46,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:46,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:46,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 20:49:46,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:49:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:49:46,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:49:46,114 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-14 20:49:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:46,160 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-14 20:49:46,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:49:46,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-14 20:49:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:46,163 INFO L225 Difference]: With dead ends: 27 [2019-01-14 20:49:46,163 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 20:49:46,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:49:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 20:49:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-01-14 20:49:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 20:49:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 20:49:46,169 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-01-14 20:49:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:46,170 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 20:49:46,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:49:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 20:49:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 20:49:46,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:46,172 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:46,172 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash 316362009, now seen corresponding path program 2 times [2019-01-14 20:49:46,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:46,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:46,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:46,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:46,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:46,245 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 [2019-01-14 20:49:46,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:46,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:46,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:46,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 20:49:46,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:46,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2019-01-14 20:49:46,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:49:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:49:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2019-01-14 20:49:46,741 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-01-14 20:49:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:51,512 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-14 20:49:51,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:51,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-14 20:49:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:51,515 INFO L225 Difference]: With dead ends: 33 [2019-01-14 20:49:51,515 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 20:49:51,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2019-01-14 20:49:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 20:49:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-01-14 20:49:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 20:49:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-14 20:49:51,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-01-14 20:49:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:51,521 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-14 20:49:51,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:49:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-14 20:49:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:49:51,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:51,523 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:51,523 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -564453139, now seen corresponding path program 1 times [2019-01-14 20:49:51,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:51,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:51,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:51,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:51,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:51,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:51,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 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 [2019-01-14 20:49:51,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:51,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:51,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:51,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:49:51,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:49:51,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:49:51,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:51,748 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 7 states. [2019-01-14 20:49:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:51,921 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-14 20:49:51,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:51,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-14 20:49:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:51,924 INFO L225 Difference]: With dead ends: 35 [2019-01-14 20:49:51,924 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 20:49:51,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 20:49:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-14 20:49:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 20:49:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-14 20:49:51,928 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2019-01-14 20:49:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:51,929 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-14 20:49:51,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:49:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-14 20:49:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 20:49:51,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:51,931 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:51,931 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:51,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash 817651018, now seen corresponding path program 2 times [2019-01-14 20:49:51,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:51,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:51,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:51,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:52,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:52,037 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 [2019-01-14 20:49:52,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:52,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:49:52,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:52,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:52,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:52,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 20:49:52,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:49:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:49:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:52,143 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 8 states. [2019-01-14 20:49:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:52,241 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-14 20:49:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:49:52,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 20:49:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:52,244 INFO L225 Difference]: With dead ends: 39 [2019-01-14 20:49:52,244 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 20:49:52,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 20:49:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-14 20:49:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 20:49:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-14 20:49:52,250 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-01-14 20:49:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:52,250 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-14 20:49:52,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:49:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-14 20:49:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 20:49:52,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:52,251 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:52,252 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1120001241, now seen corresponding path program 3 times [2019-01-14 20:49:52,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:52,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:52,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:52,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:52,381 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 [2019-01-14 20:49:52,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:49:52,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 20:49:52,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:52,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:52,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:52,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 20:49:52,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:49:52,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:49:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:52,512 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 9 states. [2019-01-14 20:49:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:52,631 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-14 20:49:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:52,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-01-14 20:49:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:52,633 INFO L225 Difference]: With dead ends: 43 [2019-01-14 20:49:52,633 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 20:49:52,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 20:49:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-14 20:49:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 20:49:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-14 20:49:52,637 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2019-01-14 20:49:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:52,639 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-14 20:49:52,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:49:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-14 20:49:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 20:49:52,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:52,640 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:52,640 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash 92254852, now seen corresponding path program 4 times [2019-01-14 20:49:52,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:52,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:52,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:52,783 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 [2019-01-14 20:49:52,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 20:49:52,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 20:49:52,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:52,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:52,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:52,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 20:49:52,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:52,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:52,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:52,899 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 10 states. [2019-01-14 20:49:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:53,106 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-14 20:49:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:49:53,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-14 20:49:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:53,109 INFO L225 Difference]: With dead ends: 47 [2019-01-14 20:49:53,109 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 20:49:53,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 20:49:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-01-14 20:49:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 20:49:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-14 20:49:53,116 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-01-14 20:49:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:53,117 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-14 20:49:53,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-14 20:49:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 20:49:53,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:53,120 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:53,120 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 696273761, now seen corresponding path program 5 times [2019-01-14 20:49:53,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:53,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:53,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:53,647 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 [2019-01-14 20:49:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 20:49:53,690 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-14 20:49:53,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:53,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:53,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:53,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 20:49:53,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:49:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:49:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:53,739 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 11 states. [2019-01-14 20:49:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:53,827 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-14 20:49:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:53,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-14 20:49:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:53,831 INFO L225 Difference]: With dead ends: 51 [2019-01-14 20:49:53,832 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 20:49:53,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 20:49:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-14 20:49:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 20:49:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-14 20:49:53,839 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2019-01-14 20:49:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:53,840 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-14 20:49:53,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:49:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-14 20:49:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 20:49:53,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:53,842 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:53,843 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:53,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1214304834, now seen corresponding path program 6 times [2019-01-14 20:49:53,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:53,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:53,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:54,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:54,038 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 [2019-01-14 20:49:54,047 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 20:49:54,092 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 20:49:54,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:54,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:54,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:54,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 20:49:54,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:49:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:49:54,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:54,142 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 12 states. [2019-01-14 20:49:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:54,233 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-14 20:49:54,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 20:49:54,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2019-01-14 20:49:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:54,236 INFO L225 Difference]: With dead ends: 55 [2019-01-14 20:49:54,236 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 20:49:54,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 20:49:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-14 20:49:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 20:49:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-14 20:49:54,244 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-01-14 20:49:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:54,244 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-14 20:49:54,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:49:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-14 20:49:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 20:49:54,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:54,245 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:54,245 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2090572187, now seen corresponding path program 7 times [2019-01-14 20:49:54,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:54,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:54,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:54,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:54,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:54,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:54,625 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 [2019-01-14 20:49:54,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:54,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:54,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:54,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 20:49:54,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:49:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:49:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:54,704 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 13 states. [2019-01-14 20:49:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:54,814 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-14 20:49:54,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:54,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-14 20:49:54,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:54,816 INFO L225 Difference]: With dead ends: 56 [2019-01-14 20:49:54,816 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 20:49:54,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 20:49:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-14 20:49:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 20:49:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-14 20:49:54,822 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2019-01-14 20:49:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:54,822 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-14 20:49:54,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:49:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-14 20:49:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 20:49:54,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:54,824 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:54,826 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 20:49:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1402261240, now seen corresponding path program 8 times [2019-01-14 20:49:54,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:54,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:49:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:49:54,952 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 20:49:55,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:49:55 BoogieIcfgContainer [2019-01-14 20:49:55,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:49:55,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:49:55,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:49:55,016 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:49:55,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:44" (3/4) ... [2019-01-14 20:49:55,021 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 20:49:55,091 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:49:55,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:49:55,093 INFO L168 Benchmark]: Toolchain (without parser) took 11611.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:55,095 INFO L168 Benchmark]: CDTParser took 0.17 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. [2019-01-14 20:49:55,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:55,096 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:55,098 INFO L168 Benchmark]: RCFGBuilder took 504.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:55,099 INFO L168 Benchmark]: TraceAbstraction took 10750.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:55,099 INFO L168 Benchmark]: Witness Printer took 76.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:55,104 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.17 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 236.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 504.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10750.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Witness Printer took 76.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L6] char *p = alloca(10 * sizeof(char)); [L8] int i = 0; VAL [alloca(10 * sizeof(char))={12:0}, i=0, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=0, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=1, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=1, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=2, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={12:0}, i=2, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=3, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=3, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=4, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=4, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=5, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=5, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=6, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=6, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=7, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=7, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=8, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=8, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=9, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=9, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L8] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L12] EXPR p[2] VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}, p[2]=97] [L12] COND TRUE p[2] == 'a' [L13] free(p) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L13] free(p) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 8 error locations. UNSAFE Result, 10.6s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 235 SDslu, 660 SDs, 0 SdLazy, 351 SolverSat, 20 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, 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, 15 MinimizatonAttempts, 36 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 665 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 590 ConstructedInterpolants, 1 QuantifiedInterpolants, 48915 SizeOfPredicates, 9 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 9/1053 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...