./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.i -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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:24:01,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:24:01,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:24:01,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:24:01,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:24:01,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:24:01,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:24:01,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:24:01,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:24:01,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:24:01,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:24:01,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:24:01,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:24:01,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:24:01,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:24:01,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:24:01,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:24:01,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:24:01,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:24:01,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:24:01,313 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:24:01,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:24:01,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:24:01,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:24:01,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:24:01,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:24:01,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:24:01,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:24:01,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:24:01,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:24:01,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:24:01,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:24:01,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:24:01,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:24:01,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:24:01,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:24:01,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:24:01,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:24:01,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:24:01,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:24:01,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:24:01,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:24:01,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:24:01,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:24:01,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:24:01,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:24:01,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:24:01,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:24:01,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:24:01,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:24:01,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:24:01,357 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:24:01,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:24:01,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:24:01,358 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:24:01,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:24:01,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:24:01,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:24:01,359 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:24:01,359 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:24:01,359 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:24:01,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:24:01,359 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:24:01,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:24:01,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:24:01,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:24:01,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:24:01,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:24:01,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:24:01,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:24:01,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:24:01,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:24:01,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:24:01,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2022-07-23 06:24:01,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:24:01,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:24:01,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:24:01,577 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:24:01,578 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:24:01,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-23 06:24:01,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a12f2b4/fa215204a41d455fad7fe420f5e09d74/FLAG1c3556783 [2022-07-23 06:24:02,036 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:24:02,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-23 06:24:02,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a12f2b4/fa215204a41d455fad7fe420f5e09d74/FLAG1c3556783 [2022-07-23 06:24:02,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a12f2b4/fa215204a41d455fad7fe420f5e09d74 [2022-07-23 06:24:02,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:24:02,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:24:02,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:24:02,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:24:02,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:24:02,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e35d3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02, skipping insertion in model container [2022-07-23 06:24:02,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:24:02,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:24:02,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-23 06:24:02,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:24:02,326 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:24:02,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-23 06:24:02,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:24:02,396 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:24:02,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02 WrapperNode [2022-07-23 06:24:02,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:24:02,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:24:02,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:24:02,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:24:02,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,440 INFO L137 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-07-23 06:24:02,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:24:02,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:24:02,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:24:02,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:24:02,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:24:02,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:24:02,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:24:02,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:24:02,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (1/1) ... [2022-07-23 06:24:02,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:24:02,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:24:02,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:24:02,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:24:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:24:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:24:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:24:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:24:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:24:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:24:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:24:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:24:02,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:24:02,618 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:24:02,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:24:02,724 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:24:02,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:24:02,729 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 06:24:02,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:24:02 BoogieIcfgContainer [2022-07-23 06:24:02,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:24:02,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:24:02,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:24:02,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:24:02,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:24:02" (1/3) ... [2022-07-23 06:24:02,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c772fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:24:02, skipping insertion in model container [2022-07-23 06:24:02,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:02" (2/3) ... [2022-07-23 06:24:02,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c772fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:24:02, skipping insertion in model container [2022-07-23 06:24:02,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:24:02" (3/3) ... [2022-07-23 06:24:02,757 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2022-07-23 06:24:02,767 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:24:02,767 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-23 06:24:02,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:24:02,836 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6238b65, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74ad10b2 [2022-07-23 06:24:02,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-07-23 06:24:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:24:02,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:02,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:24:02,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:02,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash 28716783, now seen corresponding path program 1 times [2022-07-23 06:24:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:02,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383570447] [2022-07-23 06:24:02,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:02,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:02,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383570447] [2022-07-23 06:24:02,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383570447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:02,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:02,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:24:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385336033] [2022-07-23 06:24:02,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:02,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 06:24:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 06:24:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 06:24:03,010 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,027 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-23 06:24:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 06:24:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 06:24:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,034 INFO L225 Difference]: With dead ends: 28 [2022-07-23 06:24:03,034 INFO L226 Difference]: Without dead ends: 25 [2022-07-23 06:24:03,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 06:24:03,041 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-23 06:24:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-23 06:24:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-23 06:24:03,064 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2022-07-23 06:24:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,064 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-23 06:24:03,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-23 06:24:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:24:03,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:24:03,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 889570012, now seen corresponding path program 1 times [2022-07-23 06:24:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662900351] [2022-07-23 06:24:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662900351] [2022-07-23 06:24:03,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662900351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:24:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873290246] [2022-07-23 06:24:03,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:03,101 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,152 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-07-23 06:24:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:03,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 06:24:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,153 INFO L225 Difference]: With dead ends: 39 [2022-07-23 06:24:03,154 INFO L226 Difference]: Without dead ends: 38 [2022-07-23 06:24:03,154 INFO L412 NwaCegarLoop]: 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 [2022-07-23 06:24:03,156 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-23 06:24:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-23 06:24:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-23 06:24:03,160 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 6 [2022-07-23 06:24:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,160 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-23 06:24:03,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-23 06:24:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:24:03,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:24:03,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,163 INFO L85 PathProgramCache]: Analyzing trace with hash 889570056, now seen corresponding path program 1 times [2022-07-23 06:24:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633759520] [2022-07-23 06:24:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633759520] [2022-07-23 06:24:03,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633759520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:24:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624199432] [2022-07-23 06:24:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:03,203 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,223 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-07-23 06:24:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 06:24:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,225 INFO L225 Difference]: With dead ends: 36 [2022-07-23 06:24:03,226 INFO L226 Difference]: Without dead ends: 35 [2022-07-23 06:24:03,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:03,228 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-23 06:24:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-07-23 06:24:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-07-23 06:24:03,231 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 6 [2022-07-23 06:24:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,231 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-23 06:24:03,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-07-23 06:24:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:24:03,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:24:03,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2022-07-23 06:24:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944034016] [2022-07-23 06:24:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944034016] [2022-07-23 06:24:03,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944034016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:24:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332301126] [2022-07-23 06:24:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:03,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:03,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:03,264 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,287 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-23 06:24:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 06:24:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,288 INFO L225 Difference]: With dead ends: 25 [2022-07-23 06:24:03,289 INFO L226 Difference]: Without dead ends: 25 [2022-07-23 06:24:03,289 INFO L412 NwaCegarLoop]: 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 [2022-07-23 06:24:03,293 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-23 06:24:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-23 06:24:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-23 06:24:03,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 6 [2022-07-23 06:24:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,296 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-23 06:24:03,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-23 06:24:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:24:03,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:24:03,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash 889571372, now seen corresponding path program 1 times [2022-07-23 06:24:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682762028] [2022-07-23 06:24:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682762028] [2022-07-23 06:24:03,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682762028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:24:03,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721244524] [2022-07-23 06:24:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:03,349 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,364 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-07-23 06:24:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:03,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 06:24:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,365 INFO L225 Difference]: With dead ends: 23 [2022-07-23 06:24:03,365 INFO L226 Difference]: Without dead ends: 23 [2022-07-23 06:24:03,365 INFO L412 NwaCegarLoop]: 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 [2022-07-23 06:24:03,366 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-23 06:24:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-23 06:24:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-23 06:24:03,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 6 [2022-07-23 06:24:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,368 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-23 06:24:03,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-23 06:24:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:24:03,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,369 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:24:03,369 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170662, now seen corresponding path program 1 times [2022-07-23 06:24:03,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839980852] [2022-07-23 06:24:03,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839980852] [2022-07-23 06:24:03,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839980852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:24:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296280182] [2022-07-23 06:24:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:24:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:24:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:24:03,417 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,451 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-07-23 06:24:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:24:03,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:24:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,452 INFO L225 Difference]: With dead ends: 38 [2022-07-23 06:24:03,452 INFO L226 Difference]: Without dead ends: 38 [2022-07-23 06:24:03,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:03,453 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-23 06:24:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2022-07-23 06:24:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-23 06:24:03,456 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2022-07-23 06:24:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,456 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-23 06:24:03,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-23 06:24:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:24:03,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,457 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:24:03,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170706, now seen corresponding path program 1 times [2022-07-23 06:24:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954189701] [2022-07-23 06:24:03,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954189701] [2022-07-23 06:24:03,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954189701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:24:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024779164] [2022-07-23 06:24:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:24:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:24:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:24:03,497 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,532 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-23 06:24:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:24:03,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:24:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,533 INFO L225 Difference]: With dead ends: 29 [2022-07-23 06:24:03,533 INFO L226 Difference]: Without dead ends: 29 [2022-07-23 06:24:03,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:03,534 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-23 06:24:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-07-23 06:24:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-23 06:24:03,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2022-07-23 06:24:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,536 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-23 06:24:03,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-23 06:24:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:24:03,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,537 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:24:03,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170707, now seen corresponding path program 1 times [2022-07-23 06:24:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055743681] [2022-07-23 06:24:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055743681] [2022-07-23 06:24:03,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055743681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:24:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183649938] [2022-07-23 06:24:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:24:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:24:03,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:24:03,615 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,649 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-07-23 06:24:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:24:03,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:24:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,650 INFO L225 Difference]: With dead ends: 33 [2022-07-23 06:24:03,650 INFO L226 Difference]: Without dead ends: 33 [2022-07-23 06:24:03,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:03,650 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-23 06:24:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-07-23 06:24:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-07-23 06:24:03,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-07-23 06:24:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,653 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-23 06:24:03,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-07-23 06:24:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:24:03,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,653 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:24:03,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -349878285, now seen corresponding path program 1 times [2022-07-23 06:24:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029528975] [2022-07-23 06:24:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:03,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:24:03,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029528975] [2022-07-23 06:24:03,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029528975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:03,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:03,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:24:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438663657] [2022-07-23 06:24:03,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:03,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:24:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:24:03,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:24:03,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:03,717 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:03,771 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-23 06:24:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:24:03,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 06:24:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:03,773 INFO L225 Difference]: With dead ends: 30 [2022-07-23 06:24:03,773 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 06:24:03,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:24:03,775 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:03,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 06:24:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-07-23 06:24:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-07-23 06:24:03,783 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2022-07-23 06:24:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:03,783 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-23 06:24:03,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-07-23 06:24:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:24:03,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:03,784 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 06:24:03,784 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 666457592, now seen corresponding path program 1 times [2022-07-23 06:24:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:24:03,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261112170] [2022-07-23 06:24:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:24:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:24:03,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 06:24:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:24:03,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 06:24:03,835 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 06:24:03,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-07-23 06:24:03,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-07-23 06:24:03,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-07-23 06:24:03,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-07-23 06:24:03,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-07-23 06:24:03,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-07-23 06:24:03,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2022-07-23 06:24:03,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2022-07-23 06:24:03,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2022-07-23 06:24:03,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2022-07-23 06:24:03,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:24:03,841 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:03,843 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 06:24:03,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 06:24:03 BoogieIcfgContainer [2022-07-23 06:24:03,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 06:24:03,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 06:24:03,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 06:24:03,858 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 06:24:03,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:24:02" (3/4) ... [2022-07-23 06:24:03,860 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 06:24:03,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 06:24:03,861 INFO L158 Benchmark]: Toolchain (without parser) took 1802.07ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 72.7MB in the beginning and 92.3MB in the end (delta: -19.6MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2022-07-23 06:24:03,861 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:24:03,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.78ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 74.7MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 06:24:03,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.15ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 73.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:24:03,862 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 107.0MB. Free memory was 73.0MB in the beginning and 71.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:24:03,862 INFO L158 Benchmark]: RCFGBuilder took 260.46ms. Allocated memory is still 107.0MB. Free memory was 71.6MB in the beginning and 60.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 06:24:03,862 INFO L158 Benchmark]: TraceAbstraction took 1116.77ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 60.1MB in the beginning and 93.3MB in the end (delta: -33.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:24:03,863 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 130.0MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:24:03,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.78ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 74.7MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.15ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 73.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 107.0MB. Free memory was 73.0MB in the beginning and 71.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.46ms. Allocated memory is still 107.0MB. Free memory was 71.6MB in the beginning and 60.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1116.77ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 60.1MB in the beginning and 93.3MB in the end (delta: -33.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 130.0MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={-1:0}] [L537] t->h = 1 VAL [p={0:0}, t={-1:0}] [L538] t->n = p VAL [p={0:0}, t={-1:0}] [L539] p = t VAL [p={-1:0}, t={-1:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={-1:0}, t={-1:0}] [L542] EXPR p->h VAL [p={-1:0}, p->h=1, t={-1:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={-1:0}, p->n={0:0}, t={-1:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 160 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-23 06:24:03,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:24:05,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:24:05,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:24:05,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:24:05,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:24:05,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:24:05,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:24:05,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:24:05,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:24:05,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:24:05,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:24:05,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:24:05,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:24:05,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:24:05,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:24:05,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:24:05,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:24:05,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:24:05,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:24:05,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:24:05,639 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:24:05,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:24:05,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:24:05,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:24:05,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:24:05,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:24:05,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:24:05,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:24:05,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:24:05,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:24:05,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:24:05,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:24:05,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:24:05,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:24:05,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:24:05,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:24:05,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:24:05,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:24:05,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:24:05,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:24:05,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:24:05,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:24:05,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:24:05,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:24:05,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:24:05,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:24:05,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:24:05,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:24:05,672 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:24:05,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:24:05,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:24:05,673 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:24:05,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:24:05,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:24:05,674 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:24:05,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:24:05,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:24:05,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:24:05,674 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:24:05,675 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:24:05,675 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:24:05,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:24:05,675 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:24:05,675 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:24:05,675 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:24:05,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:24:05,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:24:05,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:24:05,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:24:05,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:24:05,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:24:05,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:24:05,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:24:05,677 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:24:05,677 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:24:05,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:24:05,677 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2022-07-23 06:24:05,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:24:05,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:24:05,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:24:05,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:24:05,971 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:24:05,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-23 06:24:06,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c65ba96d/4e8e49b851cf4db4b7f14f4ddfe29a98/FLAG8632ea7e8 [2022-07-23 06:24:06,455 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:24:06,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-23 06:24:06,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c65ba96d/4e8e49b851cf4db4b7f14f4ddfe29a98/FLAG8632ea7e8 [2022-07-23 06:24:06,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c65ba96d/4e8e49b851cf4db4b7f14f4ddfe29a98 [2022-07-23 06:24:06,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:24:06,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:24:06,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:24:06,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:24:06,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:24:06,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:24:06" (1/1) ... [2022-07-23 06:24:06,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34197e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:06, skipping insertion in model container [2022-07-23 06:24:06,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:24:06" (1/1) ... [2022-07-23 06:24:06,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:24:06,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:24:07,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-23 06:24:07,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:24:07,108 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:24:07,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-23 06:24:07,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:24:07,171 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:24:07,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07 WrapperNode [2022-07-23 06:24:07,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:24:07,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:24:07,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:24:07,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:24:07,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,202 INFO L137 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-07-23 06:24:07,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:24:07,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:24:07,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:24:07,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:24:07,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:24:07,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:24:07,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:24:07,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:24:07,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (1/1) ... [2022-07-23 06:24:07,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:24:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:24:07,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:24:07,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:24:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 06:24:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:24:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:24:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:24:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:24:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 06:24:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 06:24:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:24:07,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:24:07,397 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:24:07,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:24:07,610 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:24:07,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:24:07,614 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 06:24:07,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:24:07 BoogieIcfgContainer [2022-07-23 06:24:07,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:24:07,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:24:07,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:24:07,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:24:07,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:24:06" (1/3) ... [2022-07-23 06:24:07,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249a4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:24:07, skipping insertion in model container [2022-07-23 06:24:07,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:24:07" (2/3) ... [2022-07-23 06:24:07,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249a4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:24:07, skipping insertion in model container [2022-07-23 06:24:07,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:24:07" (3/3) ... [2022-07-23 06:24:07,622 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2022-07-23 06:24:07,632 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:24:07,632 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-23 06:24:07,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:24:07,677 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79066549, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d5e923e [2022-07-23 06:24:07,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-07-23 06:24:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:24:07,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:07,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:24:07,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash 28698492, now seen corresponding path program 1 times [2022-07-23 06:24:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609257562] [2022-07-23 06:24:07,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:07,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:07,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:07,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 06:24:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:07,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 06:24:07,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:07,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:07,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:07,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609257562] [2022-07-23 06:24:07,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609257562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:07,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:07,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:24:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901342693] [2022-07-23 06:24:07,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:07,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:07,825 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:07,875 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-07-23 06:24:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 06:24:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:07,882 INFO L225 Difference]: With dead ends: 40 [2022-07-23 06:24:07,883 INFO L226 Difference]: Without dead ends: 36 [2022-07-23 06:24:07,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:07,888 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:07,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-23 06:24:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-07-23 06:24:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.85) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-23 06:24:07,914 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 5 [2022-07-23 06:24:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:07,914 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-23 06:24:07,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-07-23 06:24:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:24:07,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:07,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:24:07,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 06:24:08,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:08,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 28698536, now seen corresponding path program 1 times [2022-07-23 06:24:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:08,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010537811] [2022-07-23 06:24:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:08,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:08,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:08,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 06:24:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:08,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:24:08,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:08,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:08,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010537811] [2022-07-23 06:24:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010537811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:08,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:08,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:24:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697480024] [2022-07-23 06:24:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:08,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:08,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:08,191 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:08,230 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-23 06:24:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:08,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 06:24:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:08,232 INFO L225 Difference]: With dead ends: 34 [2022-07-23 06:24:08,232 INFO L226 Difference]: Without dead ends: 33 [2022-07-23 06:24:08,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:08,233 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:08,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-23 06:24:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2022-07-23 06:24:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-23 06:24:08,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2022-07-23 06:24:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:08,238 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-23 06:24:08,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-23 06:24:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:24:08,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:08,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:24:08,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:08,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:08,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2022-07-23 06:24:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:08,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898811238] [2022-07-23 06:24:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:08,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:08,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:08,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 06:24:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:08,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:24:08,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:08,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:24:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:08,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:08,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:08,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898811238] [2022-07-23 06:24:08,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898811238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:08,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:08,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:24:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901944848] [2022-07-23 06:24:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:08,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:08,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:08,517 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:08,566 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-07-23 06:24:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:08,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 06:24:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:08,567 INFO L225 Difference]: With dead ends: 23 [2022-07-23 06:24:08,568 INFO L226 Difference]: Without dead ends: 23 [2022-07-23 06:24:08,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:08,571 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:08,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-23 06:24:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-23 06:24:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-23 06:24:08,579 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2022-07-23 06:24:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:08,579 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-23 06:24:08,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-23 06:24:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:24:08,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:08,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:24:08,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:08,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:08,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2022-07-23 06:24:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:08,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294719555] [2022-07-23 06:24:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:08,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:08,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:08,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 06:24:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:08,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:24:08,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:08,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:24:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:08,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:08,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294719555] [2022-07-23 06:24:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294719555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:08,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:08,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:24:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873473198] [2022-07-23 06:24:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:08,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:24:08,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:24:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:08,843 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:08,871 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-07-23 06:24:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:24:08,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 06:24:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:08,872 INFO L225 Difference]: With dead ends: 21 [2022-07-23 06:24:08,872 INFO L226 Difference]: Without dead ends: 21 [2022-07-23 06:24:08,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:24:08,873 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:08,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:24:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-23 06:24:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-23 06:24:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-23 06:24:08,875 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2022-07-23 06:24:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:08,876 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-23 06:24:08,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-23 06:24:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:24:08,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:08,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:08,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:09,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:09,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash -653129230, now seen corresponding path program 1 times [2022-07-23 06:24:09,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:09,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647571638] [2022-07-23 06:24:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:09,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:09,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 06:24:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:09,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:24:09,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:09,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:09,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:09,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647571638] [2022-07-23 06:24:09,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647571638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:09,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:09,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:24:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888265348] [2022-07-23 06:24:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:09,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:24:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:09,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:24:09,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:24:09,159 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:09,225 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-07-23 06:24:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:24:09,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:24:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:09,227 INFO L225 Difference]: With dead ends: 36 [2022-07-23 06:24:09,227 INFO L226 Difference]: Without dead ends: 36 [2022-07-23 06:24:09,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:09,228 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:09,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:24:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-23 06:24:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2022-07-23 06:24:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-23 06:24:09,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2022-07-23 06:24:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:09,231 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-23 06:24:09,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-23 06:24:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:24:09,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:09,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:09,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:09,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:09,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -653129186, now seen corresponding path program 1 times [2022-07-23 06:24:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236795205] [2022-07-23 06:24:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:09,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:09,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:09,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 06:24:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:09,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:24:09,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:09,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:24:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:09,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:09,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:09,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236795205] [2022-07-23 06:24:09,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236795205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:09,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:09,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:24:09,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883341639] [2022-07-23 06:24:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:09,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:24:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:24:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:24:09,507 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:09,567 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-07-23 06:24:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:24:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:24:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:09,569 INFO L225 Difference]: With dead ends: 27 [2022-07-23 06:24:09,569 INFO L226 Difference]: Without dead ends: 27 [2022-07-23 06:24:09,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:09,570 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:09,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:24:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-23 06:24:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-23 06:24:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-23 06:24:09,573 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2022-07-23 06:24:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:09,573 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-23 06:24:09,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-23 06:24:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:24:09,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:09,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:09,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:09,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:09,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash -653129185, now seen corresponding path program 1 times [2022-07-23 06:24:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:09,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171455383] [2022-07-23 06:24:09,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:09,782 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:09,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 06:24:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:09,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:24:09,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:09,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:24:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:09,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:09,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:09,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171455383] [2022-07-23 06:24:09,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171455383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:09,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:09,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:24:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447970144] [2022-07-23 06:24:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:09,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:24:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:09,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:24:09,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:24:09,896 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:09,959 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-07-23 06:24:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:24:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:24:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:09,963 INFO L225 Difference]: With dead ends: 31 [2022-07-23 06:24:09,963 INFO L226 Difference]: Without dead ends: 31 [2022-07-23 06:24:09,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:09,963 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:09,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:24:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-23 06:24:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-07-23 06:24:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-23 06:24:09,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2022-07-23 06:24:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:09,965 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-23 06:24:09,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-23 06:24:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:24:09,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:09,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:09,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:10,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:10,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -591922145, now seen corresponding path program 1 times [2022-07-23 06:24:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:10,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520111035] [2022-07-23 06:24:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:10,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:10,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:10,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 06:24:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:24:10,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:24:10,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:24:10,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:24:10,255 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 06:24:10,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:24:10,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:24:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:24:10,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:24:10,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:24:10,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520111035] [2022-07-23 06:24:10,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520111035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:24:10,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:24:10,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:24:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539582192] [2022-07-23 06:24:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:24:10,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:24:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:24:10,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:24:10,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:24:10,289 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:24:10,376 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-07-23 06:24:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:24:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:24:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:24:10,377 INFO L225 Difference]: With dead ends: 28 [2022-07-23 06:24:10,377 INFO L226 Difference]: Without dead ends: 28 [2022-07-23 06:24:10,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:24:10,378 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:24:10,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:24:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-23 06:24:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-23 06:24:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-23 06:24:10,380 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2022-07-23 06:24:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:24:10,380 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-23 06:24:10,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:24:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-23 06:24:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:24:10,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:24:10,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:10,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:10,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:10,581 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-23 06:24:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:24:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1187913323, now seen corresponding path program 1 times [2022-07-23 06:24:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:24:10,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378396022] [2022-07-23 06:24:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:24:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:24:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:24:10,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:24:10,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 06:24:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:24:10,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 06:24:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:24:10,690 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-23 06:24:10,691 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 06:24:10,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-07-23 06:24:10,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-07-23 06:24:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-07-23 06:24:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-07-23 06:24:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-07-23 06:24:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-07-23 06:24:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2022-07-23 06:24:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2022-07-23 06:24:10,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2022-07-23 06:24:10,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2022-07-23 06:24:10,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:24:10,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:24:10,897 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:24:10,899 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 06:24:10,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 06:24:10 BoogieIcfgContainer [2022-07-23 06:24:10,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 06:24:10,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 06:24:10,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 06:24:10,918 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 06:24:10,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:24:07" (3/4) ... [2022-07-23 06:24:10,920 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 06:24:10,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 06:24:10,921 INFO L158 Benchmark]: Toolchain (without parser) took 4069.29ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 39.4MB in the beginning and 45.2MB in the end (delta: -5.9MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-07-23 06:24:10,921 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 52.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:24:10,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.76ms. Allocated memory is still 60.8MB. Free memory was 39.2MB in the beginning and 38.2MB in the end (delta: 976.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-23 06:24:10,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.51ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 36.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:24:10,922 INFO L158 Benchmark]: Boogie Preprocessor took 19.78ms. Allocated memory is still 60.8MB. Free memory was 36.4MB in the beginning and 34.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:24:10,922 INFO L158 Benchmark]: RCFGBuilder took 392.21ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 34.9MB in the beginning and 61.6MB in the end (delta: -26.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2022-07-23 06:24:10,922 INFO L158 Benchmark]: TraceAbstraction took 3299.90ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 45.2MB in the end (delta: 15.8MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-07-23 06:24:10,922 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 81.8MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:24:10,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 52.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.76ms. Allocated memory is still 60.8MB. Free memory was 39.2MB in the beginning and 38.2MB in the end (delta: 976.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.51ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 36.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.78ms. Allocated memory is still 60.8MB. Free memory was 36.4MB in the beginning and 34.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.21ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 34.9MB in the beginning and 61.6MB in the end (delta: -26.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3299.90ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 45.2MB in the end (delta: 15.8MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 81.8MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={6:0}] [L537] t->h = 1 VAL [p={0:0}, t={6:0}] [L538] t->n = p VAL [p={0:0}, t={6:0}] [L539] p = t VAL [p={6:0}, t={6:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={6:0}, t={6:0}] [L542] EXPR p->h VAL [p={6:0}, p->h=1, t={6:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={6:0}, p->n={0:0}, t={6:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 119 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=1, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 9 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-23 06:24:10,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample