./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/memory-alloca/c.03-alloca-2.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 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:19:21,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:19:21,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:19:21,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:19:21,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:19:21,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:19:21,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:19:21,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:19:21,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:19:21,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:19:21,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:19:21,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:19:21,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:19:21,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:19:21,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:19:21,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:19:21,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:19:21,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:19:21,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:19:21,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:19:21,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:19:21,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:19:21,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:19:21,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:19:21,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:19:21,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:19:21,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:19:21,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:19:21,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:19:21,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:19:21,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:19:21,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:19:21,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:19:21,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:19:21,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:19:21,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:19:21,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:19:21,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:19:21,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:19:21,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:19:21,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:19:21,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:19:21,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:19:21,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:19:21,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:19:21,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:19:21,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:19:21,423 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:19:21,423 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:19:21,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:19:21,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:19:21,424 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:19:21,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:19:21,425 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:19:21,425 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:19:21,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:19:21,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:19:21,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:19:21,426 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:19:21,426 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:19:21,426 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:19:21,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:19:21,426 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:19:21,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:19:21,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:19:21,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:19:21,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:19:21,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:19:21,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:19:21,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:19:21,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:19:21,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:19:21,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:19:21,428 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 -> 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 [2022-07-21 17:19:21,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:19:21,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:19:21,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:19:21,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:19:21,850 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:19:21,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2022-07-21 17:19:21,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec55f79f8/7ca28dd476e4499196b57defc984f6d0/FLAG13fd34480 [2022-07-21 17:19:22,277 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:19:22,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2022-07-21 17:19:22,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec55f79f8/7ca28dd476e4499196b57defc984f6d0/FLAG13fd34480 [2022-07-21 17:19:22,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec55f79f8/7ca28dd476e4499196b57defc984f6d0 [2022-07-21 17:19:22,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:19:22,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:19:22,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:19:22,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:19:22,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:19:22,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:19:22" (1/1) ... [2022-07-21 17:19:22,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7e4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:22, skipping insertion in model container [2022-07-21 17:19:22,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:19:22" (1/1) ... [2022-07-21 17:19:22,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:19:22,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:19:22,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:19:22,973 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:19:23,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:19:23,052 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:19:23,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23 WrapperNode [2022-07-21 17:19:23,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:19:23,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:19:23,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:19:23,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:19:23,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,084 INFO L137 Inliner]: procedures = 116, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-07-21 17:19:23,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:19:23,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:19:23,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:19:23,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:19:23,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:19:23,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:19:23,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:19:23,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:19:23,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (1/1) ... [2022-07-21 17:19:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:19:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:23,152 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-21 17:19:23,159 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-21 17:19:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:19:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:19:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:19:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:19:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:19:23,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:19:23,295 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:19:23,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:19:23,550 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:19:23,555 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:19:23,555 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 17:19:23,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:19:23 BoogieIcfgContainer [2022-07-21 17:19:23,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:19:23,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:19:23,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:19:23,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:19:23,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:19:22" (1/3) ... [2022-07-21 17:19:23,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99e3446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:19:23, skipping insertion in model container [2022-07-21 17:19:23,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:23" (2/3) ... [2022-07-21 17:19:23,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99e3446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:19:23, skipping insertion in model container [2022-07-21 17:19:23,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:19:23" (3/3) ... [2022-07-21 17:19:23,562 INFO L111 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2022-07-21 17:19:23,571 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:19:23,571 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-07-21 17:19:23,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:19:23,602 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@1d50be1e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58bc83c6 [2022-07-21 17:19:23,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-07-21 17:19:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 57 states have internal predecessors, (60), 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-21 17:19:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:19:23,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:23,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:19:23,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:23,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:19:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:23,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232772019] [2022-07-21 17:19:23,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:23,783 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-21 17:19:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232772019] [2022-07-21 17:19:23,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232772019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:23,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:23,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359489887] [2022-07-21 17:19:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:23,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:23,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:23,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:23,808 INFO L87 Difference]: Start difference. First operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 57 states have internal predecessors, (60), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 17:19:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:23,875 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-07-21 17:19:23,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:23,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-21 17:19:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:23,883 INFO L225 Difference]: With dead ends: 53 [2022-07-21 17:19:23,883 INFO L226 Difference]: Without dead ends: 51 [2022-07-21 17:19:23,885 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-21 17:19:23,888 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:23,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 25 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:19:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-21 17:19:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-21 17:19:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 2.08) internal successors, (52), 50 states have internal predecessors, (52), 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-21 17:19:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-21 17:19:23,916 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 3 [2022-07-21 17:19:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:23,916 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-21 17:19:23,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 17:19:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-21 17:19:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:19:23,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:23,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:19:23,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:19:23,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:19:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:23,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158715514] [2022-07-21 17:19:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,003 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-21 17:19:24,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158715514] [2022-07-21 17:19:24,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158715514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258573946] [2022-07-21 17:19:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:24,007 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 17:19:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,054 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-21 17:19:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:24,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-21 17:19:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,056 INFO L225 Difference]: With dead ends: 46 [2022-07-21 17:19:24,056 INFO L226 Difference]: Without dead ends: 46 [2022-07-21 17:19:24,059 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-21 17:19:24,060 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-21 17:19:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-21 17:19:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.88) internal successors, (47), 45 states have internal predecessors, (47), 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-21 17:19:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-07-21 17:19:24,070 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 3 [2022-07-21 17:19:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,070 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-07-21 17:19:24,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 17:19:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-07-21 17:19:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-21 17:19:24,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:24,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-21 17:19:24,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:19:24,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-07-21 17:19:24,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:24,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259706423] [2022-07-21 17:19:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,145 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-21 17:19:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259706423] [2022-07-21 17:19:24,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259706423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333798225] [2022-07-21 17:19:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:24,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:24,152 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 17:19:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,193 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-07-21 17:19:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:24,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-07-21 17:19:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,194 INFO L225 Difference]: With dead ends: 44 [2022-07-21 17:19:24,194 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 17:19:24,195 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-21 17:19:24,198 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 17:19:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-21 17:19:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.8) internal successors, (45), 43 states have internal predecessors, (45), 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-21 17:19:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2022-07-21 17:19:24,205 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 4 [2022-07-21 17:19:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,205 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2022-07-21 17:19:24,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 17:19:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-07-21 17:19:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-21 17:19:24,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:24,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-21 17:19:24,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:19:24,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:24,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-07-21 17:19:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:24,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430439618] [2022-07-21 17:19:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,275 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-21 17:19:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430439618] [2022-07-21 17:19:24,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430439618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729173112] [2022-07-21 17:19:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:24,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:24,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:24,278 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 17:19:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,304 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-07-21 17:19:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-07-21 17:19:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,305 INFO L225 Difference]: With dead ends: 42 [2022-07-21 17:19:24,305 INFO L226 Difference]: Without dead ends: 42 [2022-07-21 17:19:24,306 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-21 17:19:24,310 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-21 17:19:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-21 17:19:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.72) internal successors, (43), 41 states have internal predecessors, (43), 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-21 17:19:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-21 17:19:24,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 4 [2022-07-21 17:19:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,316 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-21 17:19:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 17:19:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-07-21 17:19:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 17:19:24,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:24,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 17:19:24,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:19:24,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-07-21 17:19:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:24,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475791349] [2022-07-21 17:19:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,385 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-21 17:19:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475791349] [2022-07-21 17:19:24,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475791349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:24,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035552803] [2022-07-21 17:19:24,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:24,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:24,388 INFO L87 Difference]: Start difference. First operand 42 states and 43 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-21 17:19:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,418 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-07-21 17:19:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:24,418 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-21 17:19:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,419 INFO L225 Difference]: With dead ends: 38 [2022-07-21 17:19:24,419 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 17:19:24,420 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-21 17:19:24,420 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 17:19:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-21 17:19:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.56) internal successors, (39), 37 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-21 17:19:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-07-21 17:19:24,424 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 5 [2022-07-21 17:19:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,425 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-07-21 17:19:24,425 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-21 17:19:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-07-21 17:19:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 17:19:24,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:24,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 17:19:24,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:19:24,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-07-21 17:19:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:24,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047175396] [2022-07-21 17:19:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,464 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-21 17:19:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047175396] [2022-07-21 17:19:24,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047175396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38703379] [2022-07-21 17:19:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:24,466 INFO L87 Difference]: Start difference. First operand 38 states and 39 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-21 17:19:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,485 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-21 17:19:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:24,486 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-21 17:19:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,486 INFO L225 Difference]: With dead ends: 34 [2022-07-21 17:19:24,486 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 17:19:24,486 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-21 17:19:24,487 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 17 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 17:19:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-21 17:19:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 33 states have internal predecessors, (35), 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-21 17:19:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-07-21 17:19:24,489 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 5 [2022-07-21 17:19:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,490 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-07-21 17:19:24,490 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-21 17:19:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-07-21 17:19:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:19:24,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:24,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:19:24,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:19:24,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-07-21 17:19:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:24,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340995307] [2022-07-21 17:19:24,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,509 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-21 17:19:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340995307] [2022-07-21 17:19:24,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340995307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996287487] [2022-07-21 17:19:24,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:24,511 INFO L87 Difference]: Start difference. First operand 34 states and 35 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-21 17:19:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,532 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-21 17:19:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:24,532 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-21 17:19:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,533 INFO L225 Difference]: With dead ends: 30 [2022-07-21 17:19:24,533 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 17:19:24,533 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-21 17:19:24,533 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 17:19:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 17:19:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 29 states have internal predecessors, (31), 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-21 17:19:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-21 17:19:24,536 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 6 [2022-07-21 17:19:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,536 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-21 17:19:24,536 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-21 17:19:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-21 17:19:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:19:24,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:24,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:19:24,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:19:24,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:24,537 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-07-21 17:19:24,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:24,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397322056] [2022-07-21 17:19:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,560 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-21 17:19:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397322056] [2022-07-21 17:19:24,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397322056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70062028] [2022-07-21 17:19:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:24,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:24,562 INFO L87 Difference]: Start difference. First operand 30 states and 31 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-21 17:19:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,589 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-07-21 17:19:24,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:24,590 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-21 17:19:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,591 INFO L225 Difference]: With dead ends: 26 [2022-07-21 17:19:24,591 INFO L226 Difference]: Without dead ends: 26 [2022-07-21 17:19:24,591 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-21 17:19:24,591 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-21 17:19:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-21 17:19:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) 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-21 17:19:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-07-21 17:19:24,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 6 [2022-07-21 17:19:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,594 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-21 17:19:24,594 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-21 17:19:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-07-21 17:19:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:19:24,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:24,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:24,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:19:24,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-21 17:19:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1831182508, now seen corresponding path program 1 times [2022-07-21 17:19:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918611890] [2022-07-21 17:19:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:24,749 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-21 17:19:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:24,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918611890] [2022-07-21 17:19:24,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918611890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:24,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:24,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:19:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703060450] [2022-07-21 17:19:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:24,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:19:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:19:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:19:24,755 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-21 17:19:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:24,787 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-21 17:19:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:19:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-07-21 17:19:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:24,788 INFO L225 Difference]: With dead ends: 25 [2022-07-21 17:19:24,788 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 17:19:24,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:19:24,788 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:24,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 19 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 17:19:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 17:19:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-21 17:19:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 17:19:24,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-07-21 17:19:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:24,790 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 17:19:24,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-21 17:19:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 17:19:24,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 17:19:24,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-07-21 17:19:24,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-07-21 17:19:24,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-07-21 17:19:24,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-07-21 17:19:24,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-07-21 17:19:24,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-07-21 17:19:24,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-07-21 17:19:24,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-07-21 17:19:24,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-07-21 17:19:24,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-07-21 17:19:24,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-07-21 17:19:24,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-07-21 17:19:24,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-07-21 17:19:24,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-07-21 17:19:24,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-07-21 17:19:24,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-07-21 17:19:24,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-07-21 17:19:24,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-07-21 17:19:24,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-07-21 17:19:24,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-07-21 17:19:24,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-07-21 17:19:24,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-07-21 17:19:24,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-07-21 17:19:24,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-07-21 17:19:24,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-07-21 17:19:24,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-07-21 17:19:24,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-07-21 17:19:24,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-07-21 17:19:24,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-07-21 17:19:24,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-07-21 17:19:24,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-07-21 17:19:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:19:24,799 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:24,800 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:19:24,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:19:24 BoogieIcfgContainer [2022-07-21 17:19:24,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:19:24,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:19:24,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:19:24,803 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:19:24,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:19:23" (3/4) ... [2022-07-21 17:19:24,805 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 17:19:24,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-21 17:19:24,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 17:19:24,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 17:19:24,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 17:19:24,832 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 17:19:24,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:19:24,833 INFO L158 Benchmark]: Toolchain (without parser) took 2150.11ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 36.3MB in the beginning and 42.6MB in the end (delta: -6.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-07-21 17:19:24,833 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:19:24,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.16ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 36.7MB in the end (delta: -764.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:19:24,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.86ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 34.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:19:24,834 INFO L158 Benchmark]: Boogie Preprocessor took 34.76ms. Allocated memory is still 58.7MB. Free memory was 34.9MB in the beginning and 33.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:19:24,834 INFO L158 Benchmark]: RCFGBuilder took 434.33ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 33.6MB in the beginning and 47.4MB in the end (delta: -13.8MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-07-21 17:19:24,834 INFO L158 Benchmark]: TraceAbstraction took 1244.45ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 45.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2022-07-21 17:19:24,835 INFO L158 Benchmark]: Witness Printer took 30.21ms. Allocated memory is still 71.3MB. Free memory was 45.6MB in the beginning and 42.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:19:24,836 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.16ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.16ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 36.7MB in the end (delta: -764.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.86ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 34.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.76ms. Allocated memory is still 58.7MB. Free memory was 34.9MB in the beginning and 33.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.33ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 33.6MB in the beginning and 47.4MB in the end (delta: -13.8MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1244.45ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 45.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. * Witness Printer took 30.21ms. Allocated memory is still 71.3MB. Free memory was 45.6MB in the beginning and 42.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 148 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-21 17:19:24,882 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: TRUE