./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R --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 64bit --witnessprinter.graph.data.programhash 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:35:06,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:35:06,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:35:06,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:35:06,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:35:06,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:35:06,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:35:06,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:35:06,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:35:06,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:35:06,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:35:06,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:35:06,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:35:06,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:35:06,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:35:06,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:35:06,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:35:06,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:35:06,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:35:06,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:35:06,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:35:06,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:35:06,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:35:06,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:35:06,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:35:06,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:35:06,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:35:06,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:35:06,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:35:06,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:35:06,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:35:06,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:35:06,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:35:06,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:35:06,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:35:06,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:35:06,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:35:06,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:35:06,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:35:06,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:35:06,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:35:06,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-11-25 15:35:06,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:35:06,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:35:06,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:35:06,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:35:06,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:35:06,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:35:06,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:35:06,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:35:06,350 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:35:06,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:35:06,352 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:35:06,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:35:06,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:35:06,353 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:35:06,353 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:35:06,353 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:35:06,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:35:06,354 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:35:06,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:35:06,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:35:06,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:35:06,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:35:06,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:35:06,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:35:06,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:35:06,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:35:06,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:35:06,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:35:06,358 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:35:06,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:35:06,359 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 [2022-11-25 15:35:06,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:35:06,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:35:06,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:35:06,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:35:06,692 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:35:06,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2022-11-25 15:35:09,707 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:35:09,951 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:35:09,956 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2022-11-25 15:35:09,970 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/data/7ca0e4b36/7842ef09649e45f9bc4f413da8780fbd/FLAG90417bd6a [2022-11-25 15:35:09,984 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/data/7ca0e4b36/7842ef09649e45f9bc4f413da8780fbd [2022-11-25 15:35:09,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:35:09,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:35:09,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:35:09,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:35:09,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:35:09,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:35:09" (1/1) ... [2022-11-25 15:35:09,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e54b9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:09, skipping insertion in model container [2022-11-25 15:35:09,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:35:09" (1/1) ... [2022-11-25 15:35:10,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:35:10,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:35:10,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:35:10,308 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:35:10,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:35:10,367 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:35:10,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10 WrapperNode [2022-11-25 15:35:10,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:35:10,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:35:10,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:35:10,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:35:10,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,434 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2022-11-25 15:35:10,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:35:10,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:35:10,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:35:10,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:35:10,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,470 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:35:10,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:35:10,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:35:10,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:35:10,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (1/1) ... [2022-11-25 15:35:10,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:35:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:10,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:10,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:35:10,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:35:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:35:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:35:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:35:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:35:10,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:35:10,673 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:35:10,675 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:35:11,071 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:35:11,078 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:35:11,087 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:35:11,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:11 BoogieIcfgContainer [2022-11-25 15:35:11,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:35:11,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:35:11,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:35:11,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:35:11,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:35:09" (1/3) ... [2022-11-25 15:35:11,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a21786c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:35:11, skipping insertion in model container [2022-11-25 15:35:11,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:10" (2/3) ... [2022-11-25 15:35:11,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a21786c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:35:11, skipping insertion in model container [2022-11-25 15:35:11,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:11" (3/3) ... [2022-11-25 15:35:11,112 INFO L112 eAbstractionObserver]: Analyzing ICFG b.07-alloca.i [2022-11-25 15:35:11,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:35:11,136 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-11-25 15:35:11,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:35:11,212 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a8f80f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:35:11,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-11-25 15:35:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 25 states have (on average 2.2) internal successors, (55), 52 states have internal predecessors, (55), 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-11-25 15:35:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 15:35:11,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:11,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 15:35:11,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-25 15:35:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:11,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216949321] [2022-11-25 15:35:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:11,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216949321] [2022-11-25 15:35:11,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216949321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:11,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:11,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588071182] [2022-11-25 15:35:11,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:11,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:11,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:11,933 INFO L87 Difference]: Start difference. First operand has 53 states, 25 states have (on average 2.2) internal successors, (55), 52 states have internal predecessors, (55), 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-11-25 15:35:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:12,042 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-11-25 15:35:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:12,047 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-11-25 15:35:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:12,058 INFO L225 Difference]: With dead ends: 49 [2022-11-25 15:35:12,058 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 15:35:12,061 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-11-25 15:35:12,068 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:12,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:35:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 15:35:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 15:35:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 24 states have (on average 2.0) internal successors, (48), 46 states have internal predecessors, (48), 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-11-25 15:35:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-11-25 15:35:12,106 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 3 [2022-11-25 15:35:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:12,107 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-11-25 15:35:12,107 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-11-25 15:35:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-11-25 15:35:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 15:35:12,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:12,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 15:35:12,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:35:12,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:12,109 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-25 15:35:12,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:12,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011367926] [2022-11-25 15:35:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:12,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011367926] [2022-11-25 15:35:12,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011367926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:12,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:12,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:12,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468374649] [2022-11-25 15:35:12,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:12,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:12,367 INFO L87 Difference]: Start difference. First operand 47 states and 48 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-11-25 15:35:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:12,432 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-11-25 15:35:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:12,434 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-11-25 15:35:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:12,435 INFO L225 Difference]: With dead ends: 43 [2022-11-25 15:35:12,435 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 15:35:12,440 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-11-25 15:35:12,443 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:12,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 15:35:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 15:35:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 42 states have internal predecessors, (44), 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-11-25 15:35:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-11-25 15:35:12,457 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 3 [2022-11-25 15:35:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:12,458 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-11-25 15:35:12,458 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-11-25 15:35:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-11-25 15:35:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 15:35:12,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:12,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 15:35:12,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:35:12,461 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-11-25 15:35:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:12,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622156030] [2022-11-25 15:35:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:12,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622156030] [2022-11-25 15:35:12,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622156030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:12,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:12,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395709481] [2022-11-25 15:35:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:12,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:12,645 INFO L87 Difference]: Start difference. First operand 43 states and 44 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-11-25 15:35:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:12,683 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-11-25 15:35:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:12,684 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-11-25 15:35:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:12,684 INFO L225 Difference]: With dead ends: 39 [2022-11-25 15:35:12,684 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 15:35:12,685 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-11-25 15:35:12,686 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:12,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 15:35:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-25 15:35:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 38 states have internal predecessors, (40), 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-11-25 15:35:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-11-25 15:35:12,690 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 4 [2022-11-25 15:35:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:12,690 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-11-25 15:35:12,691 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-11-25 15:35:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-11-25 15:35:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 15:35:12,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:12,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 15:35:12,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:35:12,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-11-25 15:35:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:12,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190465572] [2022-11-25 15:35:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:12,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:12,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190465572] [2022-11-25 15:35:12,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190465572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:12,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:12,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964351269] [2022-11-25 15:35:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:12,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:12,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:12,874 INFO L87 Difference]: Start difference. First operand 39 states and 40 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-11-25 15:35:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:12,916 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-11-25 15:35:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:12,917 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-11-25 15:35:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:12,917 INFO L225 Difference]: With dead ends: 35 [2022-11-25 15:35:12,918 INFO L226 Difference]: Without dead ends: 35 [2022-11-25 15:35:12,919 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-11-25 15:35:12,929 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:12,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-25 15:35:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-25 15:35:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 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-11-25 15:35:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-11-25 15:35:12,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 4 [2022-11-25 15:35:12,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:12,939 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-11-25 15:35:12,939 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-11-25 15:35:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-11-25 15:35:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 15:35:12,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:12,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:35:12,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:35:12,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-11-25 15:35:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710240123] [2022-11-25 15:35:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:13,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:13,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710240123] [2022-11-25 15:35:13,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710240123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:13,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:13,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125637525] [2022-11-25 15:35:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:13,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:13,058 INFO L87 Difference]: Start difference. First operand 35 states and 36 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-11-25 15:35:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:13,107 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-11-25 15:35:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:13,108 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-11-25 15:35:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:13,110 INFO L225 Difference]: With dead ends: 32 [2022-11-25 15:35:13,110 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 15:35:13,110 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-11-25 15:35:13,111 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:13,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 15:35:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-25 15:35:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-11-25 15:35:13,127 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 5 [2022-11-25 15:35:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:13,128 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-11-25 15:35:13,128 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-11-25 15:35:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-11-25 15:35:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 15:35:13,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:13,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:35:13,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:35:13,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-11-25 15:35:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:13,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095956156] [2022-11-25 15:35:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:13,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095956156] [2022-11-25 15:35:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095956156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:13,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:13,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196652247] [2022-11-25 15:35:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:13,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:13,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:13,253 INFO L87 Difference]: Start difference. First operand 32 states and 33 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-11-25 15:35:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:13,290 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-11-25 15:35:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:13,291 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-11-25 15:35:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:13,292 INFO L225 Difference]: With dead ends: 29 [2022-11-25 15:35:13,292 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 15:35:13,292 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-11-25 15:35:13,293 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:13,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 16 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 15:35:13,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-25 15:35:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 28 states have internal predecessors, (30), 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-11-25 15:35:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-11-25 15:35:13,296 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 5 [2022-11-25 15:35:13,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:13,296 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-11-25 15:35:13,296 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-11-25 15:35:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-11-25 15:35:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 15:35:13,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:13,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:35:13,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:35:13,298 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:13,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-11-25 15:35:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:13,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592498036] [2022-11-25 15:35:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:13,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592498036] [2022-11-25 15:35:13,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592498036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:13,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:13,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115584083] [2022-11-25 15:35:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:13,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:13,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:13,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:13,351 INFO L87 Difference]: Start difference. First operand 29 states and 30 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-11-25 15:35:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:13,384 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-11-25 15:35:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:13,384 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-11-25 15:35:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:13,385 INFO L225 Difference]: With dead ends: 27 [2022-11-25 15:35:13,385 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 15:35:13,385 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-11-25 15:35:13,386 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:13,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 15:35:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 15:35:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-11-25 15:35:13,389 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 6 [2022-11-25 15:35:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:13,390 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-25 15:35:13,390 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-11-25 15:35:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-11-25 15:35:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 15:35:13,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:13,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:35:13,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:35:13,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-11-25 15:35:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:13,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212428754] [2022-11-25 15:35:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:13,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212428754] [2022-11-25 15:35:13,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212428754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:13,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:13,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:35:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363093712] [2022-11-25 15:35:13,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:13,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:35:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:35:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:35:13,475 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:13,501 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-11-25 15:35:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:35:13,502 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-11-25 15:35:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:13,502 INFO L225 Difference]: With dead ends: 25 [2022-11-25 15:35:13,502 INFO L226 Difference]: Without dead ends: 25 [2022-11-25 15:35:13,503 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-11-25 15:35:13,504 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:13,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 14 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-25 15:35:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-25 15:35:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-25 15:35:13,507 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 6 [2022-11-25 15:35:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:13,508 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-25 15:35:13,509 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-11-25 15:35:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-25 15:35:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:35:13,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:13,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:13,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:35:13,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 15:35:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1461214602, now seen corresponding path program 1 times [2022-11-25 15:35:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:13,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556530798] [2022-11-25 15:35:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:14,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556530798] [2022-11-25 15:35:14,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556530798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:14,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:14,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:35:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700447092] [2022-11-25 15:35:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:14,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:35:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:35:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:35:14,326 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-11-25 15:35:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:14,377 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-11-25 15:35:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:35:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-11-25 15:35:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:14,380 INFO L225 Difference]: With dead ends: 24 [2022-11-25 15:35:14,380 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 15:35:14,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:35:14,382 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:14,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 20 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:35:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 15:35:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 15:35:14,384 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-11-25 15:35:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 15:35:14,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-11-25 15:35:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:14,385 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:35:14,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-11-25 15:35:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:35:14,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 15:35:14,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2022-11-25 15:35:14,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2022-11-25 15:35:14,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2022-11-25 15:35:14,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2022-11-25 15:35:14,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2022-11-25 15:35:14,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2022-11-25 15:35:14,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2022-11-25 15:35:14,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2022-11-25 15:35:14,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2022-11-25 15:35:14,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2022-11-25 15:35:14,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2022-11-25 15:35:14,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2022-11-25 15:35:14,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2022-11-25 15:35:14,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2022-11-25 15:35:14,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2022-11-25 15:35:14,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2022-11-25 15:35:14,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2022-11-25 15:35:14,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 27 remaining) [2022-11-25 15:35:14,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 27 remaining) [2022-11-25 15:35:14,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2022-11-25 15:35:14,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2022-11-25 15:35:14,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2022-11-25 15:35:14,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2022-11-25 15:35:14,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2022-11-25 15:35:14,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2022-11-25 15:35:14,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2022-11-25 15:35:14,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (0 of 27 remaining) [2022-11-25 15:35:14,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:35:14,406 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:14,408 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:35:14,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:35:14 BoogieIcfgContainer [2022-11-25 15:35:14,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:35:14,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:35:14,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:35:14,413 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:35:14,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:11" (3/4) ... [2022-11-25 15:35:14,416 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:35:14,431 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-25 15:35:14,431 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 15:35:14,432 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 15:35:14,432 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:35:14,473 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:35:14,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:35:14,474 INFO L158 Benchmark]: Toolchain (without parser) took 4486.15ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 116.3MB in the beginning and 152.9MB in the end (delta: -36.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:35:14,475 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 163.6MB. Free memory was 104.8MB in the beginning and 104.7MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:35:14,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.83ms. Allocated memory is still 163.6MB. Free memory was 115.8MB in the beginning and 100.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 15:35:14,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.84ms. Allocated memory is still 163.6MB. Free memory was 100.2MB in the beginning and 98.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:35:14,476 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 163.6MB. Free memory was 98.1MB in the beginning and 97.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:35:14,476 INFO L158 Benchmark]: RCFGBuilder took 615.54ms. Allocated memory is still 163.6MB. Free memory was 97.0MB in the beginning and 81.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 15:35:14,476 INFO L158 Benchmark]: TraceAbstraction took 3319.32ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 80.8MB in the beginning and 156.0MB in the end (delta: -75.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:35:14,477 INFO L158 Benchmark]: Witness Printer took 61.69ms. Allocated memory is still 197.1MB. Free memory was 156.0MB in the beginning and 152.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:35:14,480 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.29ms. Allocated memory is still 163.6MB. Free memory was 104.8MB in the beginning and 104.7MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.83ms. Allocated memory is still 163.6MB. Free memory was 115.8MB in the beginning and 100.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.84ms. Allocated memory is still 163.6MB. Free memory was 100.2MB in the beginning and 98.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 163.6MB. Free memory was 98.1MB in the beginning and 97.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 615.54ms. Allocated memory is still 163.6MB. Free memory was 97.0MB in the beginning and 81.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3319.32ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 80.8MB in the beginning and 156.0MB in the end (delta: -75.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.69ms. Allocated memory is still 197.1MB. Free memory was 156.0MB in the beginning and 152.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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: 563]: 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, 53 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 145 mSDtfsCounter, 197 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=53occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 647 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 15:35:14,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5363259-66f1-4ca9-b4a4-a33fc0ef6bfb/bin/uautomizer-ZsLfNo2U6R/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