./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/derefAfterFree2_false-valid-deref.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/derefAfterFree2_false-valid-deref.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44834c55142a76240cb3980fc2bb6f5aeaa27c83 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:36:37,735 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:36:37,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:36:37,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:36:37,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:36:37,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:36:37,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:36:37,762 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:36:37,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:36:37,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:36:37,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:36:37,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:36:37,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:36:37,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:36:37,772 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:36:37,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:36:37,781 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:36:37,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:36:37,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:36:37,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:36:37,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:36:37,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:36:37,803 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:36:37,803 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:36:37,803 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:36:37,804 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:36:37,805 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:36:37,806 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:36:37,807 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:36:37,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:36:37,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:36:37,809 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:36:37,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:36:37,810 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:36:37,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:36:37,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:36:37,812 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:36:37,829 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:36:37,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:36:37,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:36:37,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:36:37,830 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:36:37,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:36:37,831 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:36:37,832 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:36:37,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:36:37,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:36:37,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:36:37,832 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:36:37,833 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:36:37,833 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:36:37,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:36:37,833 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:36:37,833 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:36:37,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:36:37,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:36:37,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:36:37,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:36:37,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:36:37,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:36:37,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:36:37,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:36:37,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:36:37,836 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 -> 44834c55142a76240cb3980fc2bb6f5aeaa27c83 [2019-01-14 00:36:37,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:36:37,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:36:37,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:36:37,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:36:37,892 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:36:37,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2019-01-14 00:36:37,955 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81eda4d97/5f545a9c6ed94b7b8940742b04fe25fe/FLAG0951fdc69 [2019-01-14 00:36:38,411 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:36:38,412 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2019-01-14 00:36:38,419 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81eda4d97/5f545a9c6ed94b7b8940742b04fe25fe/FLAG0951fdc69 [2019-01-14 00:36:38,787 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81eda4d97/5f545a9c6ed94b7b8940742b04fe25fe [2019-01-14 00:36:38,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:36:38,791 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:36:38,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:38,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:36:38,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:36:38,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:38" (1/1) ... [2019-01-14 00:36:38,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4478de63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:38, skipping insertion in model container [2019-01-14 00:36:38,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:38" (1/1) ... [2019-01-14 00:36:38,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:36:38,824 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:36:39,048 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:39,065 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:36:39,085 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:39,107 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:36:39,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39 WrapperNode [2019-01-14 00:36:39,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:39,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:36:39,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:36:39,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:36:39,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (1/1) ... [2019-01-14 00:36:39,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (1/1) ... [2019-01-14 00:36:39,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (1/1) ... [2019-01-14 00:36:39,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (1/1) ... [2019-01-14 00:36:39,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (1/1) ... [2019-01-14 00:36:39,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (1/1) ... [2019-01-14 00:36:39,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (1/1) ... [2019-01-14 00:36:39,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:36:39,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:36:39,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:36:39,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:36:39,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (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 00:36:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:36:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:36:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:36:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:36:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:36:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:36:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:36:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:36:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:36:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:36:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:36:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:36:39,615 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:36:39,616 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 00:36:39,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:39 BoogieIcfgContainer [2019-01-14 00:36:39,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:36:39,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:36:39,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:36:39,621 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:36:39,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:36:38" (1/3) ... [2019-01-14 00:36:39,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7763b2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:39, skipping insertion in model container [2019-01-14 00:36:39,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:39" (2/3) ... [2019-01-14 00:36:39,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7763b2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:39, skipping insertion in model container [2019-01-14 00:36:39,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:39" (3/3) ... [2019-01-14 00:36:39,625 INFO L112 eAbstractionObserver]: Analyzing ICFG derefAfterFree2_false-valid-deref.c [2019-01-14 00:36:39,635 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:36:39,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 00:36:39,660 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 00:36:39,686 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:36:39,687 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:36:39,687 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:36:39,687 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:36:39,687 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:36:39,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:36:39,688 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:36:39,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:36:39,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:36:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-01-14 00:36:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 00:36:39,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:39,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:39,717 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:39,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash 868112163, now seen corresponding path program 1 times [2019-01-14 00:36:39,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:39,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:39,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:39,940 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 00:36:39,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:39,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:39,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:39,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:39,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:39,959 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-01-14 00:36:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:40,102 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-01-14 00:36:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:40,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 00:36:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:40,112 INFO L225 Difference]: With dead ends: 29 [2019-01-14 00:36:40,112 INFO L226 Difference]: Without dead ends: 26 [2019-01-14 00:36:40,114 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 00:36:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-14 00:36:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-14 00:36:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 00:36:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-14 00:36:40,148 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 8 [2019-01-14 00:36:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:40,149 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-14 00:36:40,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-14 00:36:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 00:36:40,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:40,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:40,151 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:40,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:40,151 INFO L82 PathProgramCache]: Analyzing trace with hash 868112162, now seen corresponding path program 1 times [2019-01-14 00:36:40,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:40,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:40,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:40,195 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 00:36:40,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:40,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:40,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:40,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:40,202 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2019-01-14 00:36:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:40,280 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-14 00:36:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:40,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 00:36:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:40,282 INFO L225 Difference]: With dead ends: 30 [2019-01-14 00:36:40,282 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 00:36:40,283 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 00:36:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 00:36:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-14 00:36:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 00:36:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-14 00:36:40,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 8 [2019-01-14 00:36:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:40,291 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-14 00:36:40,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-14 00:36:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:36:40,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:40,293 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:40,293 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash -258436314, now seen corresponding path program 1 times [2019-01-14 00:36:40,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:40,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:40,696 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 00:36:40,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:40,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:36:40,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:40,697 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2019-01-14 00:36:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:40,813 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-14 00:36:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:36:40,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-14 00:36:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:40,814 INFO L225 Difference]: With dead ends: 25 [2019-01-14 00:36:40,815 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 00:36:40,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 00:36:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-14 00:36:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 00:36:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-14 00:36:40,819 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2019-01-14 00:36:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:40,820 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-14 00:36:40,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-14 00:36:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:36:40,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:40,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:40,821 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:40,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash 578407498, now seen corresponding path program 1 times [2019-01-14 00:36:40,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:40,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:40,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:40,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:40,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:40,862 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 00:36:40,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:40,863 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 00:36:40,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:40,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:40,931 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 00:36:40,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:40,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 00:36:40,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:36:40,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:36:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:36:40,954 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-01-14 00:36:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:41,048 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-01-14 00:36:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:36:41,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 00:36:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:41,050 INFO L225 Difference]: With dead ends: 29 [2019-01-14 00:36:41,050 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 00:36:41,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 00:36:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 00:36:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 00:36:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 00:36:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-14 00:36:41,057 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2019-01-14 00:36:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:41,057 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-14 00:36:41,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:36:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-14 00:36:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:36:41,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:41,060 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:41,060 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash -977036761, now seen corresponding path program 2 times [2019-01-14 00:36:41,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:41,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:41,181 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 00:36:41,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:41,182 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 00:36:41,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:41,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:36:41,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:41,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:41,246 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 00:36:41,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:41,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 00:36:41,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:41,274 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-01-14 00:36:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:41,366 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-01-14 00:36:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:36:41,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 00:36:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:41,368 INFO L225 Difference]: With dead ends: 33 [2019-01-14 00:36:41,368 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 00:36:41,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:41,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 00:36:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-14 00:36:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 00:36:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-01-14 00:36:41,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2019-01-14 00:36:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:41,374 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-01-14 00:36:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-01-14 00:36:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:36:41,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:41,375 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:41,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash -242667132, now seen corresponding path program 3 times [2019-01-14 00:36:41,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:41,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:41,524 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 00:36:41,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:41,526 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 00:36:41,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:36:41,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 00:36:41,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:41,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:41,603 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 00:36:41,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 00:36:41,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:36:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:36:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:36:41,625 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2019-01-14 00:36:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:41,978 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-01-14 00:36:41,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:36:41,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-14 00:36:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:41,980 INFO L225 Difference]: With dead ends: 37 [2019-01-14 00:36:41,980 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 00:36:41,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 00:36:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 00:36:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-14 00:36:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 00:36:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-14 00:36:41,985 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2019-01-14 00:36:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:41,986 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-14 00:36:41,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:36:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-01-14 00:36:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 00:36:41,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:41,987 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:41,987 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash 130667105, now seen corresponding path program 4 times [2019-01-14 00:36:41,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:41,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:41,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:41,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:42,149 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 00:36:42,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:42,149 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 00:36:42,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 00:36:42,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 00:36:42,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:42,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:42,267 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 00:36:42,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:42,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:36:42,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:36:42,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:36:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:42,287 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2019-01-14 00:36:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:42,375 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-14 00:36:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:36:42,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-14 00:36:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:42,379 INFO L225 Difference]: With dead ends: 41 [2019-01-14 00:36:42,379 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 00:36:42,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 00:36:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-14 00:36:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 00:36:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-01-14 00:36:42,385 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 25 [2019-01-14 00:36:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:42,386 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-01-14 00:36:42,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:36:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-01-14 00:36:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 00:36:42,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:42,387 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:42,388 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash -656098114, now seen corresponding path program 5 times [2019-01-14 00:36:42,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:42,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:42,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:42,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:42,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:42,597 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 00:36:42,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 00:36:42,630 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 00:36:42,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:42,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:42,808 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 00:36:42,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:42,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-01-14 00:36:42,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 00:36:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 00:36:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-14 00:36:42,832 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 15 states. [2019-01-14 00:36:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:43,471 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-01-14 00:36:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 00:36:43,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-01-14 00:36:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:43,474 INFO L225 Difference]: With dead ends: 55 [2019-01-14 00:36:43,475 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 00:36:43,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2019-01-14 00:36:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 00:36:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-14 00:36:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 00:36:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-01-14 00:36:43,482 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 29 [2019-01-14 00:36:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:43,483 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-01-14 00:36:43,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 00:36:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-01-14 00:36:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:36:43,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:43,485 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:43,486 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash 851171268, now seen corresponding path program 1 times [2019-01-14 00:36:43,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:43,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:43,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-14 00:36:43,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:43,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:43,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:43,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:43,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:43,550 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 3 states. [2019-01-14 00:36:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:43,563 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-01-14 00:36:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:43,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 00:36:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:43,566 INFO L225 Difference]: With dead ends: 54 [2019-01-14 00:36:43,566 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 00:36:43,567 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 00:36:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 00:36:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-14 00:36:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 00:36:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-01-14 00:36:43,574 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 31 [2019-01-14 00:36:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:43,574 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-01-14 00:36:43,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-01-14 00:36:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 00:36:43,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:43,577 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:43,577 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1037842699, now seen corresponding path program 1 times [2019-01-14 00:36:43,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:43,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:43,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:43,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:43,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:36:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:36:43,698 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 00:36:43,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:36:43 BoogieIcfgContainer [2019-01-14 00:36:43,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:36:43,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:36:43,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:36:43,741 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:36:43,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:39" (3/4) ... [2019-01-14 00:36:43,746 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 00:36:43,819 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:36:43,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:36:43,820 INFO L168 Benchmark]: Toolchain (without parser) took 5029.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 952.7 MB in the beginning and 878.9 MB in the end (delta: 73.8 MB). Peak memory consumption was 203.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:36:43,825 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:36:43,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:36:43,827 INFO L168 Benchmark]: Boogie Preprocessor took 53.63 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:36:43,829 INFO L168 Benchmark]: RCFGBuilder took 453.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:36:43,831 INFO L168 Benchmark]: TraceAbstraction took 4122.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.9 MB in the end (delta: 229.5 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:36:43,832 INFO L168 Benchmark]: Witness Printer took 78.19 ms. Allocated memory is still 1.2 GB. Free memory is still 878.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:36:43,838 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.63 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 453.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4122.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.9 MB in the end (delta: 229.5 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. * Witness Printer took 78.19 ms. Allocated memory is still 1.2 GB. Free memory is still 878.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L9] p[i] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 6 error locations. UNSAFE Result, 4.0s OverallTime, 10 OverallIterations, 7 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 176 SDslu, 210 SDs, 0 SdLazy, 226 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, 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, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 16674 SizeOfPredicates, 5 NumberOfNonLiveVariables, 360 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 70/247 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...