./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:29:36,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:29:36,672 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:29:36,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:29:36,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:29:36,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:29:36,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:29:36,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:29:36,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:29:36,703 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:29:36,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:29:36,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:29:36,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:29:36,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:29:36,705 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:29:36,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:29:36,706 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:29:36,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:29:36,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:29:36,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:29:36,708 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:29:36,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:29:36,709 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:29:36,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:29:36,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:29:36,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:29:36,711 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:29:36,711 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:29:36,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:29:36,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:29:36,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:29:36,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:29:36,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:29:36,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:29:36,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:29:36,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:29:36,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:29:36,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:29:36,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:29:36,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:29:36,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:29:36,715 INFO L153 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_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/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_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2023-11-29 02:29:36,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:29:36,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:29:36,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:29:36,967 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:29:36,968 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:29:36,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety/test-0019-1.i [2023-11-29 02:29:39,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:29:39,975 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:29:39,976 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/sv-benchmarks/c/memsafety/test-0019-1.i [2023-11-29 02:29:39,989 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/data/9d492fe0a/56534960cdb24a58b11f8b88c91630c5/FLAG4a0fbc571 [2023-11-29 02:29:40,001 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/data/9d492fe0a/56534960cdb24a58b11f8b88c91630c5 [2023-11-29 02:29:40,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:29:40,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:29:40,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:29:40,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:29:40,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:29:40,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787cb49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40, skipping insertion in model container [2023-11-29 02:29:40,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,062 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:29:40,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:29:40,311 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:29:40,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:29:40,372 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:29:40,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40 WrapperNode [2023-11-29 02:29:40,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:29:40,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:29:40,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:29:40,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:29:40,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,411 INFO L138 Inliner]: procedures = 125, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2023-11-29 02:29:40,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:29:40,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:29:40,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:29:40,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:29:40,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,439 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2023-11-29 02:29:40,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:29:40,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:29:40,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:29:40,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:29:40,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (1/1) ... [2023-11-29 02:29:40,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:29:40,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:29:40,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:29:40,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:29:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:29:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:29:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:29:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:29:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:29:40,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:29:40,610 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:29:40,611 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:29:40,785 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:29:40,819 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:29:40,819 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:29:40,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:40 BoogieIcfgContainer [2023-11-29 02:29:40,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:29:40,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:29:40,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:29:40,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:29:40,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:29:40" (1/3) ... [2023-11-29 02:29:40,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d5927d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:29:40, skipping insertion in model container [2023-11-29 02:29:40,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:40" (2/3) ... [2023-11-29 02:29:40,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d5927d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:29:40, skipping insertion in model container [2023-11-29 02:29:40,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:40" (3/3) ... [2023-11-29 02:29:40,829 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2023-11-29 02:29:40,848 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:29:40,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2023-11-29 02:29:40,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:29:40,890 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;@12e16e6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:29:40,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-11-29 02:29:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 41 states have internal predecessors, (42), 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) [2023-11-29 02:29:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:29:40,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:40,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:29:40,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:40,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2794, now seen corresponding path program 1 times [2023-11-29 02:29:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:40,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377640828] [2023-11-29 02:29:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377640828] [2023-11-29 02:29:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377640828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:41,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:41,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:29:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368919056] [2023-11-29 02:29:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:41,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:41,207 INFO L87 Difference]: Start difference. First operand has 42 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 41 states have internal predecessors, (42), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:29:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:41,270 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2023-11-29 02:29:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:29:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:41,280 INFO L225 Difference]: With dead ends: 40 [2023-11-29 02:29:41,280 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 02:29:41,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:41,286 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:41,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 02:29:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-29 02:29:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2023-11-29 02:29:41,333 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 2 [2023-11-29 02:29:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:41,333 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2023-11-29 02:29:41,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:29:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2023-11-29 02:29:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:29:41,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:41,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:29:41,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:29:41,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:41,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2795, now seen corresponding path program 1 times [2023-11-29 02:29:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633363993] [2023-11-29 02:29:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:41,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:41,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633363993] [2023-11-29 02:29:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633363993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:41,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:29:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899052217] [2023-11-29 02:29:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:41,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:41,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:41,494 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:29:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:41,532 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2023-11-29 02:29:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:29:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:41,533 INFO L225 Difference]: With dead ends: 37 [2023-11-29 02:29:41,533 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 02:29:41,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:41,536 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:41,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 02:29:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 02:29:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2023-11-29 02:29:41,542 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 2 [2023-11-29 02:29:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:41,543 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2023-11-29 02:29:41,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:29:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2023-11-29 02:29:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:29:41,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:41,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:29:41,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:29:41,544 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:41,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2742770, now seen corresponding path program 1 times [2023-11-29 02:29:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:41,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330244556] [2023-11-29 02:29:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330244556] [2023-11-29 02:29:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330244556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:41,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768853895] [2023-11-29 02:29:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:41,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:29:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:41,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:29:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:29:41,626 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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) [2023-11-29 02:29:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:41,688 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2023-11-29 02:29:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:29:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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 [2023-11-29 02:29:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:41,689 INFO L225 Difference]: With dead ends: 35 [2023-11-29 02:29:41,690 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 02:29:41,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:41,692 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:41,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 37 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 02:29:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 02:29:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2023-11-29 02:29:41,698 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 4 [2023-11-29 02:29:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:41,698 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2023-11-29 02:29:41,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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) [2023-11-29 02:29:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2023-11-29 02:29:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:29:41,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:41,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:29:41,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:29:41,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:41,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2742771, now seen corresponding path program 1 times [2023-11-29 02:29:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:41,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903457385] [2023-11-29 02:29:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:41,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903457385] [2023-11-29 02:29:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903457385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:41,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:41,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:29:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773408998] [2023-11-29 02:29:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:41,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:41,863 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 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) [2023-11-29 02:29:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:41,922 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2023-11-29 02:29:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:29:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 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 [2023-11-29 02:29:41,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:41,924 INFO L225 Difference]: With dead ends: 33 [2023-11-29 02:29:41,924 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 02:29:41,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:41,925 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:41,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 02:29:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 02:29:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 32 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) [2023-11-29 02:29:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2023-11-29 02:29:41,930 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 4 [2023-11-29 02:29:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:41,931 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2023-11-29 02:29:41,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 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) [2023-11-29 02:29:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2023-11-29 02:29:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:29:41,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:41,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:29:41,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:29:41,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:41,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1659164406, now seen corresponding path program 1 times [2023-11-29 02:29:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221421733] [2023-11-29 02:29:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:41,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221421733] [2023-11-29 02:29:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221421733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:41,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:41,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945643592] [2023-11-29 02:29:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:41,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:41,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:41,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:41,987 INFO L87 Difference]: Start difference. First operand 33 states and 33 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) [2023-11-29 02:29:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:42,024 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2023-11-29 02:29:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:42,025 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 [2023-11-29 02:29:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:42,026 INFO L225 Difference]: With dead ends: 29 [2023-11-29 02:29:42,026 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 02:29:42,026 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 [2023-11-29 02:29:42,027 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:42,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 02:29:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 02:29:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 28 states have internal predecessors, (29), 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) [2023-11-29 02:29:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-11-29 02:29:42,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 6 [2023-11-29 02:29:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:42,032 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-11-29 02:29:42,033 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) [2023-11-29 02:29:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-11-29 02:29:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:29:42,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:42,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:29:42,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:29:42,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:42,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:42,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1659164405, now seen corresponding path program 1 times [2023-11-29 02:29:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:42,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60072029] [2023-11-29 02:29:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60072029] [2023-11-29 02:29:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60072029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:42,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:42,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74499389] [2023-11-29 02:29:42,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:42,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:42,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:42,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:42,111 INFO L87 Difference]: Start difference. First operand 29 states and 29 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) [2023-11-29 02:29:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:42,140 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2023-11-29 02:29:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:42,141 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 [2023-11-29 02:29:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:42,141 INFO L225 Difference]: With dead ends: 25 [2023-11-29 02:29:42,141 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 02:29:42,142 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 [2023-11-29 02:29:42,143 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:42,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 16 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 02:29:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 02:29:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2023-11-29 02:29:42,147 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 6 [2023-11-29 02:29:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:42,147 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2023-11-29 02:29:42,147 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) [2023-11-29 02:29:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2023-11-29 02:29:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:29:42,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:42,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:29:42,148 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:42,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:42,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1664331593, now seen corresponding path program 1 times [2023-11-29 02:29:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611536125] [2023-11-29 02:29:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611536125] [2023-11-29 02:29:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611536125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:29:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947652680] [2023-11-29 02:29:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:42,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:29:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:42,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:29:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:29:42,475 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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) [2023-11-29 02:29:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:42,610 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2023-11-29 02:29:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:29:42,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2023-11-29 02:29:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:42,611 INFO L225 Difference]: With dead ends: 24 [2023-11-29 02:29:42,611 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 02:29:42,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:29:42,612 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:42,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 35 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:29:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 02:29:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 02:29:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2023-11-29 02:29:42,616 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2023-11-29 02:29:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:42,616 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2023-11-29 02:29:42,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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) [2023-11-29 02:29:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2023-11-29 02:29:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:29:42,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:42,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:42,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:29:42,617 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:42,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 54670366, now seen corresponding path program 1 times [2023-11-29 02:29:42,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:42,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461901485] [2023-11-29 02:29:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:43,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461901485] [2023-11-29 02:29:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461901485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:43,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:43,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:29:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399379686] [2023-11-29 02:29:43,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:43,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:29:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:43,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:29:43,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:29:43,029 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:43,263 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2023-11-29 02:29:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:29:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 02:29:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:43,264 INFO L225 Difference]: With dead ends: 24 [2023-11-29 02:29:43,264 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 02:29:43,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:29:43,265 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 101 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:43,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 18 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:29:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 02:29:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 02:29:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2023-11-29 02:29:43,269 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 12 [2023-11-29 02:29:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:43,269 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2023-11-29 02:29:43,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2023-11-29 02:29:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:29:43,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:43,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:43,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:29:43,270 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:43,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash 54671903, now seen corresponding path program 1 times [2023-11-29 02:29:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812354311] [2023-11-29 02:29:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:43,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812354311] [2023-11-29 02:29:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812354311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:43,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:43,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:29:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086404276] [2023-11-29 02:29:43,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:43,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:29:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:29:43,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:29:43,544 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:43,710 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2023-11-29 02:29:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:29:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 02:29:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:43,711 INFO L225 Difference]: With dead ends: 23 [2023-11-29 02:29:43,711 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 02:29:43,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:29:43,712 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:43,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 20 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:29:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 02:29:43,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 02:29:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2023-11-29 02:29:43,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 12 [2023-11-29 02:29:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:43,716 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2023-11-29 02:29:43,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2023-11-29 02:29:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:29:43,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:43,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:43,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:29:43,717 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:43,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1694829067, now seen corresponding path program 1 times [2023-11-29 02:29:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:43,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234380400] [2023-11-29 02:29:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234380400] [2023-11-29 02:29:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234380400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:44,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:29:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375360034] [2023-11-29 02:29:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:29:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:29:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:29:44,076 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:44,204 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2023-11-29 02:29:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 02:29:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:44,205 INFO L225 Difference]: With dead ends: 22 [2023-11-29 02:29:44,205 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 02:29:44,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:29:44,206 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:44,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 39 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:29:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 02:29:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 02:29:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 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) [2023-11-29 02:29:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2023-11-29 02:29:44,209 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 13 [2023-11-29 02:29:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:44,209 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2023-11-29 02:29:44,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2023-11-29 02:29:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 02:29:44,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:44,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:44,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:29:44,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:44,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1000093601, now seen corresponding path program 1 times [2023-11-29 02:29:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:44,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559710695] [2023-11-29 02:29:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:44,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:44,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559710695] [2023-11-29 02:29:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559710695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:44,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445986420] [2023-11-29 02:29:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:44,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:29:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:29:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:29:44,420 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:44,506 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2023-11-29 02:29:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:44,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 02:29:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:44,507 INFO L225 Difference]: With dead ends: 21 [2023-11-29 02:29:44,507 INFO L226 Difference]: Without dead ends: 21 [2023-11-29 02:29:44,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:29:44,508 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:44,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-29 02:29:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-29 02:29:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 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) [2023-11-29 02:29:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2023-11-29 02:29:44,511 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 14 [2023-11-29 02:29:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:44,511 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2023-11-29 02:29:44,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2023-11-29 02:29:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 02:29:44,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:44,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:44,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:29:44,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:44,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:44,512 INFO L85 PathProgramCache]: Analyzing trace with hash 938130637, now seen corresponding path program 1 times [2023-11-29 02:29:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:44,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103628337] [2023-11-29 02:29:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103628337] [2023-11-29 02:29:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103628337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997790193] [2023-11-29 02:29:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:44,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:29:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:29:44,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:29:44,756 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2023-11-29 02:29:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:44,850 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2023-11-29 02:29:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:44,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 [2023-11-29 02:29:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:44,852 INFO L225 Difference]: With dead ends: 20 [2023-11-29 02:29:44,852 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 02:29:44,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:29:44,853 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:44,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 20 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:29:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 02:29:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 02:29:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 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) [2023-11-29 02:29:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2023-11-29 02:29:44,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 15 [2023-11-29 02:29:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:44,856 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2023-11-29 02:29:44,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2023-11-29 02:29:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2023-11-29 02:29:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 02:29:44,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:44,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:44,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:29:44,857 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:44,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash -982721245, now seen corresponding path program 1 times [2023-11-29 02:29:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401102506] [2023-11-29 02:29:44,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:44,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401102506] [2023-11-29 02:29:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401102506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:45,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:45,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:29:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425785972] [2023-11-29 02:29:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:45,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:29:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:45,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:29:45,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:29:45,172 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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) [2023-11-29 02:29:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:45,415 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2023-11-29 02:29:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:29:45,416 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 16 [2023-11-29 02:29:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:45,416 INFO L225 Difference]: With dead ends: 19 [2023-11-29 02:29:45,417 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 02:29:45,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:29:45,418 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:45,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:29:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 02:29:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 02:29:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 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) [2023-11-29 02:29:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2023-11-29 02:29:45,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 16 [2023-11-29 02:29:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:45,420 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2023-11-29 02:29:45,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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) [2023-11-29 02:29:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2023-11-29 02:29:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 02:29:45,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:45,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:45,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:29:45,422 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-29 02:29:45,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 497691302, now seen corresponding path program 1 times [2023-11-29 02:29:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:45,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041681456] [2023-11-29 02:29:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:45,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:46,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041681456] [2023-11-29 02:29:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041681456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:46,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 02:29:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561931915] [2023-11-29 02:29:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:46,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 02:29:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:46,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:29:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:29:46,971 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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) [2023-11-29 02:29:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:48,628 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2023-11-29 02:29:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 02:29:48,629 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 18 [2023-11-29 02:29:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:48,629 INFO L225 Difference]: With dead ends: 18 [2023-11-29 02:29:48,629 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 02:29:48,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:29:48,630 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:48,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:29:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 02:29:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 02:29:48,631 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) [2023-11-29 02:29:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 02:29:48,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2023-11-29 02:29:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:48,632 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:29:48,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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) [2023-11-29 02:29:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:29:48,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 02:29:48,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2023-11-29 02:29:48,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2023-11-29 02:29:48,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2023-11-29 02:29:48,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2023-11-29 02:29:48,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2023-11-29 02:29:48,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2023-11-29 02:29:48,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2023-11-29 02:29:48,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2023-11-29 02:29:48,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2023-11-29 02:29:48,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2023-11-29 02:29:48,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2023-11-29 02:29:48,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2023-11-29 02:29:48,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2023-11-29 02:29:48,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2023-11-29 02:29:48,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2023-11-29 02:29:48,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2023-11-29 02:29:48,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2023-11-29 02:29:48,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2023-11-29 02:29:48,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2023-11-29 02:29:48,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2023-11-29 02:29:48,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2023-11-29 02:29:48,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2023-11-29 02:29:48,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2023-11-29 02:29:48,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:29:48,641 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:48,643 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:29:48,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:29:48 BoogieIcfgContainer [2023-11-29 02:29:48,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:29:48,647 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:29:48,647 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:29:48,647 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:29:48,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:40" (3/4) ... [2023-11-29 02:29:48,650 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:29:48,658 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2023-11-29 02:29:48,658 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 02:29:48,658 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 02:29:48,659 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:29:48,739 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:29:48,739 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:29:48,739 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:29:48,740 INFO L158 Benchmark]: Toolchain (without parser) took 8735.41ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 119.2MB in the beginning and 101.8MB in the end (delta: 17.3MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2023-11-29 02:29:48,740 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:29:48,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.86ms. Allocated memory is still 153.1MB. Free memory was 118.6MB in the beginning and 101.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 02:29:48,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.55ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:29:48,741 INFO L158 Benchmark]: Boogie Preprocessor took 42.67ms. Allocated memory is still 153.1MB. Free memory was 100.3MB in the beginning and 97.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:29:48,742 INFO L158 Benchmark]: RCFGBuilder took 364.13ms. Allocated memory is still 153.1MB. Free memory was 97.6MB in the beginning and 80.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 02:29:48,742 INFO L158 Benchmark]: TraceAbstraction took 7824.01ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 79.8MB in the beginning and 107.1MB in the end (delta: -27.3MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2023-11-29 02:29:48,743 INFO L158 Benchmark]: Witness Printer took 92.13ms. Allocated memory is still 237.0MB. Free memory was 107.1MB in the beginning and 101.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 02:29:48,745 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.86ms. Allocated memory is still 153.1MB. Free memory was 118.6MB in the beginning and 101.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.55ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.67ms. Allocated memory is still 153.1MB. Free memory was 100.3MB in the beginning and 97.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 364.13ms. Allocated memory is still 153.1MB. Free memory was 97.6MB in the beginning and 80.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7824.01ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 79.8MB in the beginning and 107.1MB in the end (delta: -27.3MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Witness Printer took 92.13ms. Allocated memory is still 237.0MB. Free memory was 107.1MB in the beginning and 101.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: 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, 42 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 971 IncrementalHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 170 mSDtfsCounter, 971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 108, 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, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 02:29:48,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c591c89-71bf-4606-89ce-4ccfad4673ea/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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