./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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/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-91b1670 [2018-11-28 23:01:57,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:01:57,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:01:57,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:01:57,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:01:57,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:01:57,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:01:57,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:01:57,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:01:57,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:01:57,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:01:57,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:01:57,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:01:57,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:01:57,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:01:57,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:01:57,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:01:57,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:01:57,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:01:57,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:01:57,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:01:57,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:01:57,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:01:57,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:01:57,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:01:57,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:01:57,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:01:57,965 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:01:57,966 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:01:57,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:01:57,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:01:57,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:01:57,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:01:57,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:01:57,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:01:57,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:01:57,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 23:01:58,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:01:58,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:01:58,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:01:58,011 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:01:58,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:01:58,013 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:01:58,013 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:01:58,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:01:58,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:01:58,013 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:01:58,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:01:58,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:01:58,016 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:01:58,016 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:01:58,016 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:01:58,017 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 23:01:58,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:01:58,018 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:01:58,018 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:01:58,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:01:58,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:01:58,018 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:01:58,018 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:01:58,019 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:01:58,019 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:01:58,019 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:01:58,019 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:01:58,019 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:01:58,019 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 [2018-11-28 23:01:58,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:01:58,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:01:58,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:01:58,107 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:01:58,107 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:01:58,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-11-28 23:01:58,175 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc93dc5e4/0055ab9be1284a23bba714919ca4fed8/FLAGe31239421 [2018-11-28 23:01:58,615 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:01:58,615 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-11-28 23:01:58,622 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc93dc5e4/0055ab9be1284a23bba714919ca4fed8/FLAGe31239421 [2018-11-28 23:01:58,979 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc93dc5e4/0055ab9be1284a23bba714919ca4fed8 [2018-11-28 23:01:58,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:01:58,985 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:01:58,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:01:58,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:01:58,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:01:58,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:01:58" (1/1) ... [2018-11-28 23:01:58,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc46f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:58, skipping insertion in model container [2018-11-28 23:01:58,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:01:58" (1/1) ... [2018-11-28 23:01:59,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:01:59,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:01:59,245 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:01:59,258 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:01:59,280 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:01:59,304 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:01:59,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59 WrapperNode [2018-11-28 23:01:59,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:01:59,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:01:59,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:01:59,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:01:59,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... [2018-11-28 23:01:59,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... [2018-11-28 23:01:59,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... [2018-11-28 23:01:59,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... [2018-11-28 23:01:59,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... [2018-11-28 23:01:59,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... [2018-11-28 23:01:59,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... [2018-11-28 23:01:59,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:01:59,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:01:59,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:01:59,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:01:59,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:01:59,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:01:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:01:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:01:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 23:01:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 23:01:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:01:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:01:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:01:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:01:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:01:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:01:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:01:59,956 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:01:59,956 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:01:59,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:01:59 BoogieIcfgContainer [2018-11-28 23:01:59,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:01:59,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:01:59,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:01:59,960 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:01:59,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:01:58" (1/3) ... [2018-11-28 23:01:59,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dd4689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:01:59, skipping insertion in model container [2018-11-28 23:01:59,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:01:59" (2/3) ... [2018-11-28 23:01:59,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dd4689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:01:59, skipping insertion in model container [2018-11-28 23:01:59,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:01:59" (3/3) ... [2018-11-28 23:01:59,964 INFO L112 eAbstractionObserver]: Analyzing ICFG derefAfterFree2_false-valid-deref.c [2018-11-28 23:01:59,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:01:59,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-28 23:02:00,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-28 23:02:00,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:00,031 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:00,031 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:00,031 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:00,031 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:00,032 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:00,032 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:00,032 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:00,032 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-28 23:02:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:00,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:00,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:00,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:00,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:00,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552165, now seen corresponding path program 1 times [2018-11-28 23:02:00,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:00,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:00,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:00,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:00,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:00,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:00,305 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-11-28 23:02:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:00,446 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-28 23:02:00,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:00,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:00,460 INFO L225 Difference]: With dead ends: 27 [2018-11-28 23:02:00,460 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 23:02:00,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 23:02:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-28 23:02:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:02:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-28 23:02:00,497 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2018-11-28 23:02:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:00,497 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:02:00,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-28 23:02:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:00,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:00,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:00,499 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:00,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:00,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552164, now seen corresponding path program 1 times [2018-11-28 23:02:00,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:00,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:00,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:00,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:00,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:00,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:00,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:00,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:00,570 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-28 23:02:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:00,636 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-28 23:02:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:00,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:00,637 INFO L225 Difference]: With dead ends: 28 [2018-11-28 23:02:00,638 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 23:02:00,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 23:02:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-11-28 23:02:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:02:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 23:02:00,643 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2018-11-28 23:02:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:00,644 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:02:00,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-28 23:02:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:00,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:00,645 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:00,646 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:00,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash -387375000, now seen corresponding path program 1 times [2018-11-28 23:02:00,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:00,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:00,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:00,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:00,919 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-28 23:02:01,169 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-28 23:02:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:01,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:01,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:01,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:01,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:01,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:01,275 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-28 23:02:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:01,398 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-28 23:02:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:01,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-28 23:02:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:01,401 INFO L225 Difference]: With dead ends: 23 [2018-11-28 23:02:01,402 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 23:02:01,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 23:02:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-28 23:02:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:02:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-28 23:02:01,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 12 [2018-11-28 23:02:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:01,407 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:02:01,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-28 23:02:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 23:02:01,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:01,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:01,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:01,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 876275464, now seen corresponding path program 1 times [2018-11-28 23:02:01,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:01,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:01,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:01,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:01,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:01,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:01,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:01,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:01,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:02:01,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:02:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:02:01,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:01,697 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-28 23:02:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:01,749 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-28 23:02:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:01,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 23:02:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:01,755 INFO L225 Difference]: With dead ends: 27 [2018-11-28 23:02:01,755 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 23:02:01,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 23:02:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 23:02:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:02:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 23:02:01,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-11-28 23:02:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:01,760 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 23:02:01,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:02:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 23:02:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 23:02:01,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:01,762 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:01,762 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:01,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1958351323, now seen corresponding path program 2 times [2018-11-28 23:02:01,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:01,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:01,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:01,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:01,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:01,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:01,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:01,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:01,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:01,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:01,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:01,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:01,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:02:01,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:01,930 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-28 23:02:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:02,019 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-28 23:02:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:02,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-28 23:02:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:02,021 INFO L225 Difference]: With dead ends: 31 [2018-11-28 23:02:02,021 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 23:02:02,022 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 [2018-11-28 23:02:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 23:02:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-28 23:02:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:02:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-28 23:02:02,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2018-11-28 23:02:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:02,027 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-28 23:02:02,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-28 23:02:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:02:02,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,028 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,029 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:02,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,029 INFO L82 PathProgramCache]: Analyzing trace with hash -921821502, now seen corresponding path program 3 times [2018-11-28 23:02:02,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:02,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:02,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:02,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:02:02,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:02:02,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:02,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:02,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:02:02,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:02:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:02:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:02,251 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-28 23:02:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:02,384 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-28 23:02:02,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:02,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-28 23:02:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:02,387 INFO L225 Difference]: With dead ends: 35 [2018-11-28 23:02:02,387 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 23:02:02,388 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 [2018-11-28 23:02:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 23:02:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-28 23:02:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:02:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-28 23:02:02,393 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 21 [2018-11-28 23:02:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:02,393 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-28 23:02:02,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:02:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-28 23:02:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 23:02:02,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,394 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,395 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:02,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1880966945, now seen corresponding path program 4 times [2018-11-28 23:02:02,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:02,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:02,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:02,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:02:02,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:02:02,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:02,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:02,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:02:02,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:02,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:02,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:02,634 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-11-28 23:02:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:02,907 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-28 23:02:02,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:02,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-28 23:02:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:02,909 INFO L225 Difference]: With dead ends: 39 [2018-11-28 23:02:02,909 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 23:02:02,909 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 [2018-11-28 23:02:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 23:02:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-28 23:02:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 23:02:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-28 23:02:02,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 25 [2018-11-28 23:02:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:02,915 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-28 23:02:02,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-28 23:02:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 23:02:02,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,916 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,916 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:02,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1215495292, now seen corresponding path program 5 times [2018-11-28 23:02:02,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:03,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:03,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:03,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:02:03,235 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 23:02:03,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:03,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:03,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:03,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-28 23:02:03,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 23:02:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 23:02:03,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:02:03,552 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 15 states. [2018-11-28 23:02:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:04,396 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-28 23:02:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 23:02:04,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-28 23:02:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:04,401 INFO L225 Difference]: With dead ends: 53 [2018-11-28 23:02:04,402 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 23:02:04,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2018-11-28 23:02:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 23:02:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-28 23:02:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 23:02:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-28 23:02:04,409 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 29 [2018-11-28 23:02:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:04,409 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-28 23:02:04,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 23:02:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-28 23:02:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:02:04,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:04,411 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:04,411 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:04,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1030409178, now seen corresponding path program 1 times [2018-11-28 23:02:04,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:04,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:04,500 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 23:02:04,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:04 BoogieIcfgContainer [2018-11-28 23:02:04,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:04,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:04,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:04,536 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:04,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:01:59" (3/4) ... [2018-11-28 23:02:04,540 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 23:02:04,603 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:04,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:04,604 INFO L168 Benchmark]: Toolchain (without parser) took 5620.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 952.7 MB in the beginning and 868.4 MB in the end (delta: 84.3 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:04,605 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:04,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.82 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:04,606 INFO L168 Benchmark]: Boogie Preprocessor took 56.89 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:04,607 INFO L168 Benchmark]: RCFGBuilder took 593.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:04,608 INFO L168 Benchmark]: TraceAbstraction took 4578.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 868.4 MB in the end (delta: 225.7 MB). Peak memory consumption was 225.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:04,608 INFO L168 Benchmark]: Witness Printer took 67.15 ms. Allocated memory is still 1.1 GB. Free memory is still 868.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:04,612 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.82 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.89 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 593.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4578.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 868.4 MB in the end (delta: 225.7 MB). Peak memory consumption was 225.7 MB. Max. memory is 11.5 GB. * Witness Printer took 67.15 ms. Allocated memory is still 1.1 GB. Free memory is still 868.4 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))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 5 error locations. UNSAFE Result, 4.5s OverallTime, 9 OverallIterations, 7 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 158 SDslu, 221 SDs, 0 SdLazy, 224 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 12774 SizeOfPredicates, 5 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 15/192 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...