./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:20:27,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:20:27,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:20:27,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:20:27,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:20:27,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:20:27,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:20:27,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:20:27,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:20:27,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:20:27,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:20:27,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:20:27,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:20:27,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:20:27,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:20:27,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:20:27,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:20:27,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:20:27,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:20:27,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:20:27,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:20:27,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:20:27,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:20:27,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:20:27,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:20:27,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:20:27,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:20:27,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:20:27,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:20:27,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:20:27,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:20:27,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:20:27,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:20:27,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:20:27,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:20:27,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:20:27,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:20:27,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:20:27,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:20:27,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:20:27,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:20:27,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 18:20:27,083 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:20:27,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:20:27,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:20:27,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:20:27,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:20:27,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:20:27,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:20:27,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:20:27,085 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:20:27,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:20:27,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:20:27,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:20:27,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:20:27,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:20:27,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:20:27,086 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:20:27,086 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:20:27,086 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 18:20:27,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:20:27,086 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:20:27,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:20:27,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:20:27,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:20:27,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:20:27,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:20:27,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:20:27,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:20:27,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:20:27,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:20:27,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:20:27,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:20:27,088 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:20:27,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:20:27,088 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:20:27,089 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/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_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 [2022-12-13 18:20:27,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:20:27,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:20:27,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:20:27,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:20:27,264 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:20:27,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-regression/test05.c [2022-12-13 18:20:29,870 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:20:29,995 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:20:29,995 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/sv-benchmarks/c/ldv-regression/test05.c [2022-12-13 18:20:29,999 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/data/937d1d1e2/5102721d4c4b4805b334fdbed4344965/FLAG8fe9f3220 [2022-12-13 18:20:30,009 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/data/937d1d1e2/5102721d4c4b4805b334fdbed4344965 [2022-12-13 18:20:30,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:20:30,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:20:30,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:20:30,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:20:30,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:20:30,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767dd180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30, skipping insertion in model container [2022-12-13 18:20:30,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:20:30,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:20:30,153 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/sv-benchmarks/c/ldv-regression/test05.c[710,723] [2022-12-13 18:20:30,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:20:30,166 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:20:30,180 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/sv-benchmarks/c/ldv-regression/test05.c[710,723] [2022-12-13 18:20:30,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:20:30,193 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:20:30,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30 WrapperNode [2022-12-13 18:20:30,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:20:30,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:20:30,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:20:30,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:20:30,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,227 INFO L138 Inliner]: procedures = 16, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-13 18:20:30,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:20:30,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:20:30,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:20:30,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:20:30,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,244 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:20:30,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:20:30,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:20:30,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:20:30,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (1/1) ... [2022-12-13 18:20:30,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:20:30,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:20:30,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:20:30,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:20:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 18:20:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 18:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:20:30,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:20:30,356 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:20:30,358 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:20:30,567 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:20:30,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:20:30,574 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:20:30,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:20:30 BoogieIcfgContainer [2022-12-13 18:20:30,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:20:30,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:20:30,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:20:30,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:20:30,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:20:30" (1/3) ... [2022-12-13 18:20:30,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3bb814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:20:30, skipping insertion in model container [2022-12-13 18:20:30,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:30" (2/3) ... [2022-12-13 18:20:30,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3bb814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:20:30, skipping insertion in model container [2022-12-13 18:20:30,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:20:30" (3/3) ... [2022-12-13 18:20:30,582 INFO L112 eAbstractionObserver]: Analyzing ICFG test05.c [2022-12-13 18:20:30,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:20:30,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-12-13 18:20:30,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:20:30,640 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;@66f57576, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:20:30,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-12-13 18:20:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 31 states have (on average 2.129032258064516) internal successors, (66), 63 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 18:20:30,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:30,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 18:20:30,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-13 18:20:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:30,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285912184] [2022-12-13 18:20:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:30,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285912184] [2022-12-13 18:20:30,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285912184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:30,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:30,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:20:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929754933] [2022-12-13 18:20:30,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:30,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:30,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:30,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:30,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:30,954 INFO L87 Difference]: Start difference. First operand has 64 states, 31 states have (on average 2.129032258064516) internal successors, (66), 63 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:31,029 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-12-13 18:20:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:31,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 18:20:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:31,040 INFO L225 Difference]: With dead ends: 62 [2022-12-13 18:20:31,040 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 18:20:31,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:31,045 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:31,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 32 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:20:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 18:20:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-12-13 18:20:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 2.033333333333333) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-12-13 18:20:31,079 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 3 [2022-12-13 18:20:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:31,080 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-12-13 18:20:31,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-12-13 18:20:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 18:20:31,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:31,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 18:20:31,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:20:31,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:31,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-13 18:20:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:31,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746308151] [2022-12-13 18:20:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:31,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:31,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746308151] [2022-12-13 18:20:31,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746308151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:31,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:31,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:20:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228530281] [2022-12-13 18:20:31,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:31,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:31,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:31,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:31,192 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:31,246 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-12-13 18:20:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:31,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 18:20:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:31,247 INFO L225 Difference]: With dead ends: 58 [2022-12-13 18:20:31,247 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 18:20:31,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:31,249 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:31,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 18:20:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-13 18:20:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-12-13 18:20:31,256 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 3 [2022-12-13 18:20:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:31,256 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-12-13 18:20:31,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-12-13 18:20:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 18:20:31,257 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:31,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 18:20:31,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:20:31,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:31,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-12-13 18:20:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:31,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322465960] [2022-12-13 18:20:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322465960] [2022-12-13 18:20:31,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322465960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:31,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:31,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:20:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547862280] [2022-12-13 18:20:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:31,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:31,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:31,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:31,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:31,312 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:31,353 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-12-13 18:20:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:31,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 18:20:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:31,354 INFO L225 Difference]: With dead ends: 57 [2022-12-13 18:20:31,354 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 18:20:31,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:31,356 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:31,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 18:20:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-12-13 18:20:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 56 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-12-13 18:20:31,361 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2022-12-13 18:20:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:31,362 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-12-13 18:20:31,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-12-13 18:20:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 18:20:31,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:31,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 18:20:31,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:20:31,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-12-13 18:20:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:31,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484265448] [2022-12-13 18:20:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484265448] [2022-12-13 18:20:31,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484265448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:31,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:31,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:20:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793119547] [2022-12-13 18:20:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:31,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:31,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:31,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:31,435 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:31,477 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-12-13 18:20:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:31,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 18:20:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:31,478 INFO L225 Difference]: With dead ends: 56 [2022-12-13 18:20:31,478 INFO L226 Difference]: Without dead ends: 56 [2022-12-13 18:20:31,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:20:31,479 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 52 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:31,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-13 18:20:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-12-13 18:20:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.9) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-12-13 18:20:31,484 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 4 [2022-12-13 18:20:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:31,485 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-12-13 18:20:31,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-12-13 18:20:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 18:20:31,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:31,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 18:20:31,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:20:31,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-12-13 18:20:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748283163] [2022-12-13 18:20:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:31,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748283163] [2022-12-13 18:20:31,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748283163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:31,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:31,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:20:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19585469] [2022-12-13 18:20:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:31,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:20:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:20:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:20:31,595 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:31,636 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-12-13 18:20:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:31,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 18:20:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:31,637 INFO L225 Difference]: With dead ends: 55 [2022-12-13 18:20:31,637 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 18:20:31,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:20:31,638 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:31,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 18:20:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-13 18:20:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-12-13 18:20:31,641 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 5 [2022-12-13 18:20:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:31,641 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-12-13 18:20:31,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-12-13 18:20:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 18:20:31,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:31,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 18:20:31,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:20:31,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-12-13 18:20:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:31,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649972264] [2022-12-13 18:20:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649972264] [2022-12-13 18:20:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649972264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:31,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:20:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167556560] [2022-12-13 18:20:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:31,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:20:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:20:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:20:31,746 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:31,787 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-12-13 18:20:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:31,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 18:20:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:31,788 INFO L225 Difference]: With dead ends: 54 [2022-12-13 18:20:31,788 INFO L226 Difference]: Without dead ends: 54 [2022-12-13 18:20:31,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:20:31,789 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:31,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-13 18:20:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-12-13 18:20:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-12-13 18:20:31,792 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 5 [2022-12-13 18:20:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:31,792 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-12-13 18:20:31,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-12-13 18:20:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 18:20:31,793 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:31,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:20:31,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:20:31,793 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-12-13 18:20:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:31,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974033627] [2022-12-13 18:20:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974033627] [2022-12-13 18:20:31,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974033627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:31,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:20:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986787931] [2022-12-13 18:20:31,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:31,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:20:31,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:20:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:20:31,923 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:31,967 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-12-13 18:20:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 18:20:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:31,968 INFO L225 Difference]: With dead ends: 48 [2022-12-13 18:20:31,968 INFO L226 Difference]: Without dead ends: 48 [2022-12-13 18:20:31,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:20:31,969 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:31,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 22 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-13 18:20:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-13 18:20:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 47 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-12-13 18:20:31,971 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 6 [2022-12-13 18:20:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:31,971 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-12-13 18:20:31,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-12-13 18:20:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 18:20:31,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:31,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:20:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:20:31,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-12-13 18:20:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:31,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264378863] [2022-12-13 18:20:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:32,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264378863] [2022-12-13 18:20:32,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264378863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:32,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:32,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:20:32,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056223539] [2022-12-13 18:20:32,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:32,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:20:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:32,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:20:32,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:20:32,095 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:32,133 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-12-13 18:20:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:32,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 18:20:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:32,134 INFO L225 Difference]: With dead ends: 42 [2022-12-13 18:20:32,134 INFO L226 Difference]: Without dead ends: 42 [2022-12-13 18:20:32,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:20:32,135 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:32,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-13 18:20:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-12-13 18:20:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-12-13 18:20:32,137 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 6 [2022-12-13 18:20:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:32,137 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-12-13 18:20:32,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-12-13 18:20:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 18:20:32,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:32,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:32,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:20:32,138 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1160479829, now seen corresponding path program 1 times [2022-12-13 18:20:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:32,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148285462] [2022-12-13 18:20:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:32,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:32,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148285462] [2022-12-13 18:20:32,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148285462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:32,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:32,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:20:32,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187668708] [2022-12-13 18:20:32,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:32,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:20:32,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:32,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:20:32,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:20:32,297 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:32,375 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-12-13 18:20:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:20:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 18:20:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:32,376 INFO L225 Difference]: With dead ends: 54 [2022-12-13 18:20:32,376 INFO L226 Difference]: Without dead ends: 54 [2022-12-13 18:20:32,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:20:32,377 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 84 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:32,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 41 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-13 18:20:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-12-13 18:20:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-12-13 18:20:32,380 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 14 [2022-12-13 18:20:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:32,380 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-12-13 18:20:32,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-12-13 18:20:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 18:20:32,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:32,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:32,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:20:32,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1160479828, now seen corresponding path program 1 times [2022-12-13 18:20:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:32,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586127112] [2022-12-13 18:20:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:32,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:32,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586127112] [2022-12-13 18:20:32,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586127112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:32,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:32,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:20:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222758048] [2022-12-13 18:20:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:32,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:20:32,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:20:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:20:32,457 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:32,518 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-12-13 18:20:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:20:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 18:20:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:32,519 INFO L225 Difference]: With dead ends: 50 [2022-12-13 18:20:32,519 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 18:20:32,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:20:32,520 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:32,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 37 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 18:20:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-12-13 18:20:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-12-13 18:20:32,523 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 14 [2022-12-13 18:20:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:32,523 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-12-13 18:20:32,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-12-13 18:20:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 18:20:32,524 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:32,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:32,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:20:32,524 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:32,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1662793458, now seen corresponding path program 1 times [2022-12-13 18:20:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:32,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225875019] [2022-12-13 18:20:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:32,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225875019] [2022-12-13 18:20:32,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225875019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:32,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:32,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:20:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332605107] [2022-12-13 18:20:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:32,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:20:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:20:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:20:32,601 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:32,666 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-12-13 18:20:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:20:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-12-13 18:20:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:32,667 INFO L225 Difference]: With dead ends: 49 [2022-12-13 18:20:32,667 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 18:20:32,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:20:32,668 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:32,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 36 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:20:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 18:20:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2022-12-13 18:20:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-12-13 18:20:32,670 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2022-12-13 18:20:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:32,671 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-12-13 18:20:32,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-12-13 18:20:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 18:20:32,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:32,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:32,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:20:32,672 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1662793459, now seen corresponding path program 1 times [2022-12-13 18:20:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:32,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019179708] [2022-12-13 18:20:32,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:32,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019179708] [2022-12-13 18:20:32,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019179708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:32,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:32,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:20:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381239705] [2022-12-13 18:20:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:32,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:20:32,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:20:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:20:32,775 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:32,844 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-12-13 18:20:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:20:32,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-12-13 18:20:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:32,845 INFO L225 Difference]: With dead ends: 50 [2022-12-13 18:20:32,845 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 18:20:32,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:20:32,845 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 93 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:32,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 18:20:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-12-13 18:20:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-12-13 18:20:32,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 17 [2022-12-13 18:20:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:32,848 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-12-13 18:20:32,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-12-13 18:20:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 18:20:32,849 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:32,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:32,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:20:32,849 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash 216679347, now seen corresponding path program 1 times [2022-12-13 18:20:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:32,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675884915] [2022-12-13 18:20:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:32,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675884915] [2022-12-13 18:20:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675884915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:33,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:33,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:20:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600633707] [2022-12-13 18:20:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:33,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:20:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:20:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:20:33,265 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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) [2022-12-13 18:20:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:33,447 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-12-13 18:20:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:20:33,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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) Word has length 19 [2022-12-13 18:20:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:33,447 INFO L225 Difference]: With dead ends: 47 [2022-12-13 18:20:33,447 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 18:20:33,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:20:33,448 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 105 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:33,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 116 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:20:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 18:20:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-12-13 18:20:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-12-13 18:20:33,451 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 19 [2022-12-13 18:20:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:33,451 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-12-13 18:20:33,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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) [2022-12-13 18:20:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-12-13 18:20:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 18:20:33,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:33,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:33,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:20:33,452 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 216679348, now seen corresponding path program 1 times [2022-12-13 18:20:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:33,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157697632] [2022-12-13 18:20:33,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157697632] [2022-12-13 18:20:33,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157697632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:33,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:33,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:20:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496064414] [2022-12-13 18:20:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:33,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:20:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:33,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:20:33,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:20:33,891 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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) [2022-12-13 18:20:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:34,104 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-12-13 18:20:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:20:34,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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) Word has length 19 [2022-12-13 18:20:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:34,104 INFO L225 Difference]: With dead ends: 48 [2022-12-13 18:20:34,104 INFO L226 Difference]: Without dead ends: 48 [2022-12-13 18:20:34,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:20:34,105 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 97 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:34,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 121 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:20:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-13 18:20:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-12-13 18:20:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-12-13 18:20:34,107 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 19 [2022-12-13 18:20:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:34,107 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-12-13 18:20:34,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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) [2022-12-13 18:20:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-12-13 18:20:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 18:20:34,108 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:34,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:34,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:20:34,108 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash -427886866, now seen corresponding path program 1 times [2022-12-13 18:20:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:34,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465491683] [2022-12-13 18:20:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:34,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465491683] [2022-12-13 18:20:34,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465491683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:34,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:34,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:20:34,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324079506] [2022-12-13 18:20:34,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:34,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:20:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:34,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:20:34,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:20:34,281 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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) [2022-12-13 18:20:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:34,350 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-12-13 18:20:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:20:34,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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) Word has length 19 [2022-12-13 18:20:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:34,351 INFO L225 Difference]: With dead ends: 34 [2022-12-13 18:20:34,351 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 18:20:34,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:20:34,352 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:34,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 129 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 18:20:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-13 18:20:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-12-13 18:20:34,353 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 19 [2022-12-13 18:20:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:34,354 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-12-13 18:20:34,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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) [2022-12-13 18:20:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-12-13 18:20:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 18:20:34,355 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:34,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:34,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:20:34,355 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:34,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1142223340, now seen corresponding path program 1 times [2022-12-13 18:20:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006378338] [2022-12-13 18:20:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:34,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006378338] [2022-12-13 18:20:34,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006378338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:34,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:34,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:20:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488492421] [2022-12-13 18:20:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:20:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:20:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:20:34,428 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:34,472 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2022-12-13 18:20:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:20:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 18:20:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:34,473 INFO L225 Difference]: With dead ends: 34 [2022-12-13 18:20:34,473 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 18:20:34,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:20:34,474 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:34,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 106 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 18:20:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-13 18:20:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1) internal successors, (33), 33 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2022-12-13 18:20:34,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 26 [2022-12-13 18:20:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:34,476 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2022-12-13 18:20:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2022-12-13 18:20:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 18:20:34,477 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:34,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 18:20:34,477 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1049186788, now seen corresponding path program 1 times [2022-12-13 18:20:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:34,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838910448] [2022-12-13 18:20:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:35,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838910448] [2022-12-13 18:20:35,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838910448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:35,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:35,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 18:20:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55746240] [2022-12-13 18:20:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:20:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:20:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:20:35,086 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:35,465 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-12-13 18:20:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 18:20:35,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 18:20:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:35,466 INFO L225 Difference]: With dead ends: 33 [2022-12-13 18:20:35,466 INFO L226 Difference]: Without dead ends: 33 [2022-12-13 18:20:35,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2022-12-13 18:20:35,467 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:35,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 92 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:20:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-13 18:20:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-12-13 18:20:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 32 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2022-12-13 18:20:35,468 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 27 [2022-12-13 18:20:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:35,468 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2022-12-13 18:20:35,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2022-12-13 18:20:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 18:20:35,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:35,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:35,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 18:20:35,469 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1049186789, now seen corresponding path program 1 times [2022-12-13 18:20:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:35,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197992313] [2022-12-13 18:20:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:36,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197992313] [2022-12-13 18:20:36,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197992313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:36,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:36,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 18:20:36,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194529929] [2022-12-13 18:20:36,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:36,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:20:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:36,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:20:36,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:20:36,193 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:36,692 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2022-12-13 18:20:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 18:20:36,693 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 18:20:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:36,693 INFO L225 Difference]: With dead ends: 32 [2022-12-13 18:20:36,693 INFO L226 Difference]: Without dead ends: 32 [2022-12-13 18:20:36,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-12-13 18:20:36,694 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:36,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 89 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:20:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-13 18:20:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-13 18:20:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2022-12-13 18:20:36,695 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 27 [2022-12-13 18:20:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:36,695 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2022-12-13 18:20:36,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2022-12-13 18:20:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 18:20:36,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:36,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:36,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 18:20:36,696 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1048810009, now seen corresponding path program 1 times [2022-12-13 18:20:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489154844] [2022-12-13 18:20:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489154844] [2022-12-13 18:20:37,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489154844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:37,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:37,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 18:20:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653216501] [2022-12-13 18:20:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 18:20:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 18:20:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 18:20:37,374 INFO L87 Difference]: Start difference. First operand 32 states and 31 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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) [2022-12-13 18:20:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:37,913 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-12-13 18:20:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:20:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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) Word has length 29 [2022-12-13 18:20:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:37,913 INFO L225 Difference]: With dead ends: 30 [2022-12-13 18:20:37,914 INFO L226 Difference]: Without dead ends: 30 [2022-12-13 18:20:37,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-12-13 18:20:37,915 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:37,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 73 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:20:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-13 18:20:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-12-13 18:20:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0) internal successors, (29), 29 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) [2022-12-13 18:20:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2022-12-13 18:20:37,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 29 [2022-12-13 18:20:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:37,916 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2022-12-13 18:20:37,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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) [2022-12-13 18:20:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-12-13 18:20:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 18:20:37,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:37,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 18:20:37,917 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-12-13 18:20:37,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1048809944, now seen corresponding path program 1 times [2022-12-13 18:20:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:37,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710846815] [2022-12-13 18:20:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:20:38,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710846815] [2022-12-13 18:20:38,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710846815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:38,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:20:38,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:20:38,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830790873] [2022-12-13 18:20:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:38,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:20:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:20:38,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:20:38,363 INFO L87 Difference]: Start difference. First operand 30 states and 29 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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) [2022-12-13 18:20:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:38,395 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-12-13 18:20:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:20:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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) Word has length 29 [2022-12-13 18:20:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:38,396 INFO L225 Difference]: With dead ends: 29 [2022-12-13 18:20:38,396 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 18:20:38,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:20:38,397 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:38,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 18:20:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 18:20:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:20:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 18:20:38,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-12-13 18:20:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:38,398 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 18:20:38,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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) [2022-12-13 18:20:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 18:20:38,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 18:20:38,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 32 remaining) [2022-12-13 18:20:38,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2022-12-13 18:20:38,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2022-12-13 18:20:38,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2022-12-13 18:20:38,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2022-12-13 18:20:38,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2022-12-13 18:20:38,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2022-12-13 18:20:38,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2022-12-13 18:20:38,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2022-12-13 18:20:38,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2022-12-13 18:20:38,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2022-12-13 18:20:38,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2022-12-13 18:20:38,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2022-12-13 18:20:38,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (1 of 32 remaining) [2022-12-13 18:20:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2022-12-13 18:20:38,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 18:20:38,407 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:20:38,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:20:38,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:20:38 BoogieIcfgContainer [2022-12-13 18:20:38,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:20:38,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:20:38,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:20:38,412 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:20:38,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:20:30" (3/4) ... [2022-12-13 18:20:38,415 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 18:20:38,423 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-12-13 18:20:38,423 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-12-13 18:20:38,423 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 18:20:38,423 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 18:20:38,452 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:20:38,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:20:38,453 INFO L158 Benchmark]: Toolchain (without parser) took 8440.36ms. Allocated memory was 132.1MB in the beginning and 283.1MB in the end (delta: 151.0MB). Free memory was 93.1MB in the beginning and 229.2MB in the end (delta: -136.2MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-12-13 18:20:38,453 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:20:38,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.63ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 82.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:20:38,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.94ms. Allocated memory is still 132.1MB. Free memory was 82.5MB in the beginning and 80.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:20:38,454 INFO L158 Benchmark]: Boogie Preprocessor took 19.15ms. Allocated memory is still 132.1MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:20:38,454 INFO L158 Benchmark]: RCFGBuilder took 328.30ms. Allocated memory is still 132.1MB. Free memory was 79.2MB in the beginning and 62.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 18:20:38,455 INFO L158 Benchmark]: TraceAbstraction took 7834.27ms. Allocated memory was 132.1MB in the beginning and 283.1MB in the end (delta: 151.0MB). Free memory was 62.0MB in the beginning and 233.4MB in the end (delta: -171.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:20:38,455 INFO L158 Benchmark]: Witness Printer took 40.64ms. Allocated memory is still 283.1MB. Free memory was 232.4MB in the beginning and 229.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:20:38,457 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.63ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 82.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.94ms. Allocated memory is still 132.1MB. Free memory was 82.5MB in the beginning and 80.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.15ms. Allocated memory is still 132.1MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 328.30ms. Allocated memory is still 132.1MB. Free memory was 79.2MB in the beginning and 62.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7834.27ms. Allocated memory was 132.1MB in the beginning and 283.1MB in the end (delta: 151.0MB). Free memory was 62.0MB in the beginning and 233.4MB in the end (delta: -171.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 40.64ms. Allocated memory is still 283.1MB. Free memory was 232.4MB in the beginning and 229.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 46]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 22]: 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, 64 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1278 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1278 mSDsluCounter, 1122 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 664 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1454 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 458 mSDtfsCounter, 1454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, InterpolantAutomatonStates: 131, 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, 20 MinimizatonAttempts, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 3871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 18:20:38,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea31eb6d-3316-477b-9fe4-c37511ba9ac9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE