./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:51:49,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:51:49,140 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:51:49,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:51:49,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:51:49,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:51:49,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:51:49,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:51:49,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:51:49,171 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:51:49,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:51:49,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:51:49,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:51:49,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:51:49,174 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:51:49,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:51:49,175 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:51:49,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:51:49,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:51:49,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:51:49,177 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:51:49,178 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:51:49,178 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:51:49,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:51:49,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:51:49,179 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:51:49,180 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:51:49,180 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:51:49,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:51:49,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:51:49,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:51:49,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:51:49,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:51:49,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:51:49,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:51:49,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:51:49,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:51:49,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:51:49,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:51:49,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:51:49,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:51:49,184 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 [2023-11-29 02:51:49,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:51:49,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:51:49,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:51:49,417 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:51:49,418 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:51:49,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2023-11-29 02:51:52,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:51:52,407 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:51:52,407 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2023-11-29 02:51:52,416 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/data/0f3aa13ff/d2f816b3a3484210b166465a3adb4b61/FLAG18072d4fb [2023-11-29 02:51:52,427 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/data/0f3aa13ff/d2f816b3a3484210b166465a3adb4b61 [2023-11-29 02:51:52,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:51:52,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:51:52,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:51:52,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:51:52,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:51:52,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ada860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52, skipping insertion in model container [2023-11-29 02:51:52,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:51:52,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:51:52,719 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:51:52,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:51:52,814 WARN L675 CHandler]: The function fopen is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:51:52,821 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:51:52,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52 WrapperNode [2023-11-29 02:51:52,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:51:52,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:51:52,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:51:52,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:51:52,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,894 INFO L138 Inliner]: procedures = 17, calls = 294, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 794 [2023-11-29 02:51:52,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:51:52,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:51:52,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:51:52,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:51:52,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,941 INFO L175 MemorySlicer]: Split 188 memory accesses to 5 slices as follows [2, 7, 2, 41, 136]. 72 percent of accesses are in the largest equivalence class. The 137 initializations are split as follows [2, 7, 2, 0, 126]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2023-11-29 02:51:52,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:51:52,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:51:52,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:51:52,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:51:52,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (1/1) ... [2023-11-29 02:51:52,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:51:53,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:51:53,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:51:53,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:51:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:51:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:51:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:51:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:51:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 02:51:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2023-11-29 02:51:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:51:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:51:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:51:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:51:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:51:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:51:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:51:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:51:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:51:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:51:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:51:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 02:51:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 02:51:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 02:51:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:51:53,236 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:51:53,238 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:51:53,938 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:51:54,079 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:51:54,080 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:51:54,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:51:54 BoogieIcfgContainer [2023-11-29 02:51:54,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:51:54,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:51:54,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:51:54,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:51:54,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:51:52" (1/3) ... [2023-11-29 02:51:54,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572a70f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:51:54, skipping insertion in model container [2023-11-29 02:51:54,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:52" (2/3) ... [2023-11-29 02:51:54,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572a70f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:51:54, skipping insertion in model container [2023-11-29 02:51:54,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:51:54" (3/3) ... [2023-11-29 02:51:54,089 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lhb-reducer.c [2023-11-29 02:51:54,108 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:51:54,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2023-11-29 02:51:54,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:51:54,165 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;@67dede0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:51:54,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-29 02:51:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 97 states have (on average 2.5051546391752577) internal successors, (243), 201 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 02:51:54,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:54,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 02:51:54,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:54,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 472420, now seen corresponding path program 1 times [2023-11-29 02:51:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451426243] [2023-11-29 02:51:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:54,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451426243] [2023-11-29 02:51:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451426243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:54,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838872255] [2023-11-29 02:51:54,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:54,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:51:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:54,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:51:54,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:51:54,518 INFO L87 Difference]: Start difference. First operand has 202 states, 97 states have (on average 2.5051546391752577) internal successors, (243), 201 states have internal predecessors, (243), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.0) 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) [2023-11-29 02:51:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:54,842 INFO L93 Difference]: Finished difference Result 203 states and 233 transitions. [2023-11-29 02:51:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:51:54,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 [2023-11-29 02:51:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:54,856 INFO L225 Difference]: With dead ends: 203 [2023-11-29 02:51:54,856 INFO L226 Difference]: Without dead ends: 201 [2023-11-29 02:51:54,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:51:54,862 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 124 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:54,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 295 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:51:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-29 02:51:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2023-11-29 02:51:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 97 states have (on average 2.3711340206185567) internal successors, (230), 200 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2023-11-29 02:51:54,909 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 3 [2023-11-29 02:51:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:54,909 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2023-11-29 02:51:54,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 02:51:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2023-11-29 02:51:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 02:51:54,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:54,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 02:51:54,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:51:54,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:54,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:54,911 INFO L85 PathProgramCache]: Analyzing trace with hash 472077, now seen corresponding path program 1 times [2023-11-29 02:51:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079864039] [2023-11-29 02:51:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:54,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:54,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079864039] [2023-11-29 02:51:54,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079864039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:54,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322088450] [2023-11-29 02:51:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:51:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:51:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:51:54,992 INFO L87 Difference]: Start difference. First operand 201 states and 230 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 02:51:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:55,294 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2023-11-29 02:51:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:51:55,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 [2023-11-29 02:51:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:55,297 INFO L225 Difference]: With dead ends: 160 [2023-11-29 02:51:55,297 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 02:51:55,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:51:55,299 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 311 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:55,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 55 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:51:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 02:51:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-11-29 02:51:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 159 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2023-11-29 02:51:55,311 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 3 [2023-11-29 02:51:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:55,311 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2023-11-29 02:51:55,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 02:51:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2023-11-29 02:51:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 02:51:55,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:55,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 02:51:55,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:51:55,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:55,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash 472078, now seen corresponding path program 1 times [2023-11-29 02:51:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530546429] [2023-11-29 02:51:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:55,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:55,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530546429] [2023-11-29 02:51:55,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530546429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:55,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:55,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:55,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364327765] [2023-11-29 02:51:55,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:55,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:51:55,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:55,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:51:55,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:51:55,444 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 02:51:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:55,675 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2023-11-29 02:51:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:51:55,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 [2023-11-29 02:51:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:55,678 INFO L225 Difference]: With dead ends: 119 [2023-11-29 02:51:55,679 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 02:51:55,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:51:55,680 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 186 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:55,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 140 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:51:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 02:51:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-29 02:51:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5257731958762886) internal successors, (148), 118 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2023-11-29 02:51:55,690 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 3 [2023-11-29 02:51:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:55,690 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2023-11-29 02:51:55,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 02:51:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2023-11-29 02:51:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:51:55,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:55,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:55,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:51:55,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:55,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:55,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1022535160, now seen corresponding path program 1 times [2023-11-29 02:51:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87602950] [2023-11-29 02:51:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87602950] [2023-11-29 02:51:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87602950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:51:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096295526] [2023-11-29 02:51:55,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:55,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:55,969 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:56,104 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2023-11-29 02:51:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:56,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2023-11-29 02:51:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:56,106 INFO L225 Difference]: With dead ends: 121 [2023-11-29 02:51:56,106 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 02:51:56,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:56,108 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:56,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 163 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:51:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 02:51:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-11-29 02:51:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 118 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 147 transitions. [2023-11-29 02:51:56,117 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 147 transitions. Word has length 46 [2023-11-29 02:51:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:56,118 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 147 transitions. [2023-11-29 02:51:56,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2023-11-29 02:51:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:51:56,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:56,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:56,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:51:56,121 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:56,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1633588135, now seen corresponding path program 1 times [2023-11-29 02:51:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756452896] [2023-11-29 02:51:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756452896] [2023-11-29 02:51:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756452896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:51:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435892268] [2023-11-29 02:51:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:56,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:56,330 INFO L87 Difference]: Start difference. First operand 119 states and 147 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:56,418 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2023-11-29 02:51:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:56,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 02:51:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:56,420 INFO L225 Difference]: With dead ends: 119 [2023-11-29 02:51:56,420 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 02:51:56,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:56,422 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 101 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:56,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 105 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:51:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 02:51:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-29 02:51:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2023-11-29 02:51:56,429 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 47 [2023-11-29 02:51:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:56,429 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2023-11-29 02:51:56,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2023-11-29 02:51:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:51:56,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:56,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:56,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:51:56,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:56,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1633587967, now seen corresponding path program 1 times [2023-11-29 02:51:56,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:56,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718077775] [2023-11-29 02:51:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:56,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718077775] [2023-11-29 02:51:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718077775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:51:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677375185] [2023-11-29 02:51:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:56,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:51:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:51:56,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:51:56,747 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:56,952 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2023-11-29 02:51:56,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:51:56,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 02:51:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:56,955 INFO L225 Difference]: With dead ends: 118 [2023-11-29 02:51:56,955 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 02:51:56,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:51:56,957 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:56,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 49 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:51:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 02:51:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-29 02:51:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 117 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2023-11-29 02:51:56,963 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 47 [2023-11-29 02:51:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:56,963 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2023-11-29 02:51:56,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2023-11-29 02:51:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:51:56,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:56,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:56,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:51:56,966 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:56,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1633587968, now seen corresponding path program 1 times [2023-11-29 02:51:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:56,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654850449] [2023-11-29 02:51:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654850449] [2023-11-29 02:51:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654850449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:57,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:57,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:51:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065154368] [2023-11-29 02:51:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:57,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:51:57,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:51:57,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:51:57,348 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:57,711 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2023-11-29 02:51:57,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:51:57,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 02:51:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:57,713 INFO L225 Difference]: With dead ends: 117 [2023-11-29 02:51:57,713 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 02:51:57,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:51:57,714 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 210 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:57,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 61 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:51:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 02:51:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-29 02:51:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 116 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2023-11-29 02:51:57,719 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 47 [2023-11-29 02:51:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:57,719 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2023-11-29 02:51:57,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2023-11-29 02:51:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 02:51:57,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:57,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:57,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:51:57,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:57,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2079981948, now seen corresponding path program 1 times [2023-11-29 02:51:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060402537] [2023-11-29 02:51:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060402537] [2023-11-29 02:51:58,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060402537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:58,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:51:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387617911] [2023-11-29 02:51:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:58,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:51:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:51:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:51:58,349 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 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) [2023-11-29 02:51:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:58,665 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2023-11-29 02:51:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:51:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 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) Word has length 49 [2023-11-29 02:51:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:58,666 INFO L225 Difference]: With dead ends: 116 [2023-11-29 02:51:58,666 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 02:51:58,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:51:58,667 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 69 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:58,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 129 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:51:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 02:51:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-29 02:51:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 114 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2023-11-29 02:51:58,671 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 49 [2023-11-29 02:51:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:58,672 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2023-11-29 02:51:58,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 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) [2023-11-29 02:51:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2023-11-29 02:51:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 02:51:58,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:58,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:58,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:51:58,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:58,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1458658685, now seen corresponding path program 1 times [2023-11-29 02:51:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:58,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217752333] [2023-11-29 02:51:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:58,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:58,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217752333] [2023-11-29 02:51:58,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217752333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:58,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:58,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:51:58,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280854907] [2023-11-29 02:51:58,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:58,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:51:58,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:58,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:51:58,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:51:58,886 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:59,078 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2023-11-29 02:51:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:51:59,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-29 02:51:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:59,080 INFO L225 Difference]: With dead ends: 114 [2023-11-29 02:51:59,080 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 02:51:59,080 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 [2023-11-29 02:51:59,081 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 198 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:59,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 52 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:51:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 02:51:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-11-29 02:51:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.1875) internal successors, (114), 113 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2023-11-29 02:51:59,085 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 52 [2023-11-29 02:51:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:59,085 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2023-11-29 02:51:59,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2023-11-29 02:51:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 02:51:59,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:59,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:59,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:51:59,086 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:59,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:59,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1458658684, now seen corresponding path program 1 times [2023-11-29 02:51:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:59,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013371345] [2023-11-29 02:51:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:59,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013371345] [2023-11-29 02:51:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013371345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:51:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349899437] [2023-11-29 02:51:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:59,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:51:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:51:59,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:51:59,506 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:51:59,794 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2023-11-29 02:51:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:51:59,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-29 02:51:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:51:59,795 INFO L225 Difference]: With dead ends: 113 [2023-11-29 02:51:59,795 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 02:51:59,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:51:59,796 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 166 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:51:59,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 59 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:51:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 02:51:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-29 02:51:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.1770833333333333) internal successors, (113), 112 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2023-11-29 02:51:59,801 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 52 [2023-11-29 02:51:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:51:59,801 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2023-11-29 02:51:59,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2023-11-29 02:51:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 02:51:59,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:51:59,803 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, 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] [2023-11-29 02:51:59,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:51:59,803 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:51:59,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 709308752, now seen corresponding path program 1 times [2023-11-29 02:51:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244997120] [2023-11-29 02:51:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:00,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244997120] [2023-11-29 02:52:00,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244997120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:00,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:00,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:00,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146413513] [2023-11-29 02:52:00,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:00,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:00,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:00,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:00,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:00,048 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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) [2023-11-29 02:52:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:00,219 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2023-11-29 02:52:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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) Word has length 57 [2023-11-29 02:52:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:00,221 INFO L225 Difference]: With dead ends: 112 [2023-11-29 02:52:00,221 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 02:52:00,221 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 [2023-11-29 02:52:00,222 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 182 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:00,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 54 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 02:52:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-29 02:52:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 111 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2023-11-29 02:52:00,225 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 57 [2023-11-29 02:52:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:00,226 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2023-11-29 02:52:00,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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) [2023-11-29 02:52:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2023-11-29 02:52:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 02:52:00,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:00,227 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, 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] [2023-11-29 02:52:00,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:52:00,227 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:00,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 709308753, now seen corresponding path program 1 times [2023-11-29 02:52:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608383732] [2023-11-29 02:52:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608383732] [2023-11-29 02:52:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608383732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:00,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:00,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:52:00,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830044769] [2023-11-29 02:52:00,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:00,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:52:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:00,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:52:00,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:52:00,715 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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) [2023-11-29 02:52:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:01,019 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2023-11-29 02:52:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:52:01,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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) Word has length 57 [2023-11-29 02:52:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:01,021 INFO L225 Difference]: With dead ends: 111 [2023-11-29 02:52:01,021 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 02:52:01,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:52:01,022 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 270 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:01,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 64 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 02:52:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 02:52:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.15625) internal successors, (111), 110 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2023-11-29 02:52:01,025 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 57 [2023-11-29 02:52:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:01,026 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2023-11-29 02:52:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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) [2023-11-29 02:52:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2023-11-29 02:52:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 02:52:01,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:01,027 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, 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, 1, 1, 1, 1] [2023-11-29 02:52:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:52:01,027 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:01,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1526752884, now seen corresponding path program 1 times [2023-11-29 02:52:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630293528] [2023-11-29 02:52:01,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:01,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:01,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630293528] [2023-11-29 02:52:01,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630293528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:01,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:01,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051143706] [2023-11-29 02:52:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:01,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:01,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:01,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:01,248 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:01,422 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2023-11-29 02:52:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2023-11-29 02:52:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:01,424 INFO L225 Difference]: With dead ends: 110 [2023-11-29 02:52:01,424 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 02:52:01,424 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 [2023-11-29 02:52:01,425 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 166 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:01,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 56 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 02:52:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-29 02:52:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 109 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2023-11-29 02:52:01,428 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 62 [2023-11-29 02:52:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:01,429 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2023-11-29 02:52:01,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2023-11-29 02:52:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 02:52:01,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:01,430 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, 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, 1, 1, 1, 1] [2023-11-29 02:52:01,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:52:01,430 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:01,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:01,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1526752885, now seen corresponding path program 1 times [2023-11-29 02:52:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55647417] [2023-11-29 02:52:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55647417] [2023-11-29 02:52:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55647417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:01,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:52:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600800317] [2023-11-29 02:52:01,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:01,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:52:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:52:01,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:52:01,811 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:02,111 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2023-11-29 02:52:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:52:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2023-11-29 02:52:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:02,113 INFO L225 Difference]: With dead ends: 109 [2023-11-29 02:52:02,113 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 02:52:02,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:52:02,114 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 250 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:02,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 66 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 02:52:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-29 02:52:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 108 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2023-11-29 02:52:02,118 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 62 [2023-11-29 02:52:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:02,118 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2023-11-29 02:52:02,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2023-11-29 02:52:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 02:52:02,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:02,119 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:02,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:52:02,119 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:02,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1697010593, now seen corresponding path program 1 times [2023-11-29 02:52:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240035681] [2023-11-29 02:52:02,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:02,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:02,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240035681] [2023-11-29 02:52:02,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240035681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:02,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:02,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:02,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395621702] [2023-11-29 02:52:02,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:02,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:02,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:02,337 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:02,502 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2023-11-29 02:52:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2023-11-29 02:52:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:02,503 INFO L225 Difference]: With dead ends: 108 [2023-11-29 02:52:02,504 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 02:52:02,504 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 [2023-11-29 02:52:02,505 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:02,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 58 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:52:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 02:52:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-29 02:52:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.125) internal successors, (108), 107 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2023-11-29 02:52:02,508 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 67 [2023-11-29 02:52:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:02,509 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2023-11-29 02:52:02,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2023-11-29 02:52:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 02:52:02,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:02,510 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:02,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:52:02,510 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:02,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1697010594, now seen corresponding path program 1 times [2023-11-29 02:52:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973163758] [2023-11-29 02:52:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973163758] [2023-11-29 02:52:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973163758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:52:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666027768] [2023-11-29 02:52:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:02,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:52:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:52:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:52:02,889 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:03,196 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2023-11-29 02:52:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:52:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2023-11-29 02:52:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:03,198 INFO L225 Difference]: With dead ends: 107 [2023-11-29 02:52:03,198 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 02:52:03,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:52:03,198 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 131 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:03,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 69 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 02:52:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-29 02:52:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 106 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2023-11-29 02:52:03,202 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 67 [2023-11-29 02:52:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:03,202 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2023-11-29 02:52:03,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2023-11-29 02:52:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 02:52:03,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:03,203 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:03,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:52:03,203 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:03,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1536285083, now seen corresponding path program 1 times [2023-11-29 02:52:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772636780] [2023-11-29 02:52:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:03,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:03,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772636780] [2023-11-29 02:52:03,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772636780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:03,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:03,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:03,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184089124] [2023-11-29 02:52:03,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:03,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:03,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:03,377 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:03,540 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2023-11-29 02:52:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2023-11-29 02:52:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:03,542 INFO L225 Difference]: With dead ends: 106 [2023-11-29 02:52:03,542 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 02:52:03,542 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 [2023-11-29 02:52:03,542 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 134 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:03,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 60 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:52:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 02:52:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-29 02:52:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 105 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2023-11-29 02:52:03,546 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 72 [2023-11-29 02:52:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:03,546 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2023-11-29 02:52:03,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2023-11-29 02:52:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 02:52:03,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:03,547 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:03,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:52:03,547 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:03,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1536285082, now seen corresponding path program 1 times [2023-11-29 02:52:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948255615] [2023-11-29 02:52:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948255615] [2023-11-29 02:52:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948255615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:52:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635901287] [2023-11-29 02:52:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:03,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:52:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:52:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:52:03,954 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:04,282 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2023-11-29 02:52:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:52:04,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2023-11-29 02:52:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:04,283 INFO L225 Difference]: With dead ends: 105 [2023-11-29 02:52:04,284 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 02:52:04,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:52:04,285 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 120 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:04,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 71 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:52:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 02:52:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-29 02:52:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.09375) internal successors, (105), 104 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2023-11-29 02:52:04,289 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 72 [2023-11-29 02:52:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:04,289 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2023-11-29 02:52:04,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2023-11-29 02:52:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 02:52:04,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:04,290 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:04,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:52:04,291 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:04,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2102986254, now seen corresponding path program 1 times [2023-11-29 02:52:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:04,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747445865] [2023-11-29 02:52:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747445865] [2023-11-29 02:52:04,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747445865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:04,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:04,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:04,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856236565] [2023-11-29 02:52:04,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:04,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:04,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:04,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:04,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:04,517 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:04,684 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2023-11-29 02:52:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:04,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-11-29 02:52:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:04,685 INFO L225 Difference]: With dead ends: 104 [2023-11-29 02:52:04,685 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 02:52:04,686 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 [2023-11-29 02:52:04,686 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 118 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:04,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 62 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:52:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 02:52:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-29 02:52:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.0833333333333333) internal successors, (104), 103 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2023-11-29 02:52:04,689 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 77 [2023-11-29 02:52:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:04,690 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2023-11-29 02:52:04,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2023-11-29 02:52:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 02:52:04,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:04,691 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:04,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:52:04,691 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:04,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2102986253, now seen corresponding path program 1 times [2023-11-29 02:52:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:04,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457390162] [2023-11-29 02:52:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:05,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457390162] [2023-11-29 02:52:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457390162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:05,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:05,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:52:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417490877] [2023-11-29 02:52:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:05,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:52:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:05,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:52:05,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:52:05,243 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:05,523 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2023-11-29 02:52:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:52:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-11-29 02:52:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:05,524 INFO L225 Difference]: With dead ends: 103 [2023-11-29 02:52:05,524 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 02:52:05,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:52:05,525 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 138 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:05,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 72 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 02:52:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-29 02:52:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 102 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2023-11-29 02:52:05,528 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 77 [2023-11-29 02:52:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:05,529 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2023-11-29 02:52:05,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2023-11-29 02:52:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 02:52:05,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:05,530 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:52:05,531 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:05,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash -947068329, now seen corresponding path program 1 times [2023-11-29 02:52:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071787508] [2023-11-29 02:52:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071787508] [2023-11-29 02:52:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071787508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:52:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263703293] [2023-11-29 02:52:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:52:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:05,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:52:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:52:05,946 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:06,210 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2023-11-29 02:52:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:52:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2023-11-29 02:52:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:06,212 INFO L225 Difference]: With dead ends: 102 [2023-11-29 02:52:06,212 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 02:52:06,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:52:06,213 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 124 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:06,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 74 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 02:52:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 02:52:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 96 states have (on average 1.0625) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2023-11-29 02:52:06,216 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 82 [2023-11-29 02:52:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:06,217 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2023-11-29 02:52:06,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2023-11-29 02:52:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 02:52:06,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:06,218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:52:06,218 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:06,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash -947068330, now seen corresponding path program 1 times [2023-11-29 02:52:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054335598] [2023-11-29 02:52:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054335598] [2023-11-29 02:52:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054335598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049953507] [2023-11-29 02:52:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:06,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:06,455 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:06,617 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2023-11-29 02:52:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:06,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2023-11-29 02:52:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:06,620 INFO L225 Difference]: With dead ends: 101 [2023-11-29 02:52:06,620 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 02:52:06,621 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 [2023-11-29 02:52:06,621 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 99 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:06,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 64 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:52:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 02:52:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-29 02:52:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 100 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2023-11-29 02:52:06,624 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 82 [2023-11-29 02:52:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:06,625 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2023-11-29 02:52:06,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2023-11-29 02:52:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 02:52:06,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:06,626 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, 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, 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] [2023-11-29 02:52:06,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:52:06,626 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:06,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1504977987, now seen corresponding path program 1 times [2023-11-29 02:52:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:06,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949720487] [2023-11-29 02:52:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:06,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:06,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949720487] [2023-11-29 02:52:06,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949720487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:06,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:06,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176600258] [2023-11-29 02:52:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:06,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:06,859 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:07,026 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2023-11-29 02:52:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:07,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2023-11-29 02:52:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:07,027 INFO L225 Difference]: With dead ends: 101 [2023-11-29 02:52:07,027 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 02:52:07,028 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 [2023-11-29 02:52:07,028 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:07,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 72 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:52:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 02:52:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2023-11-29 02:52:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2023-11-29 02:52:07,032 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 87 [2023-11-29 02:52:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:07,032 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2023-11-29 02:52:07,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2023-11-29 02:52:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 02:52:07,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:07,033 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, 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, 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] [2023-11-29 02:52:07,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:52:07,033 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:07,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1504977988, now seen corresponding path program 1 times [2023-11-29 02:52:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594327950] [2023-11-29 02:52:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594327950] [2023-11-29 02:52:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594327950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:07,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:52:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930096203] [2023-11-29 02:52:07,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:52:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:52:07,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:52:07,664 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:07,954 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2023-11-29 02:52:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:52:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2023-11-29 02:52:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:07,955 INFO L225 Difference]: With dead ends: 100 [2023-11-29 02:52:07,955 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 02:52:07,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:52:07,956 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 77 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:07,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 83 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 02:52:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2023-11-29 02:52:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 96 states have (on average 1.03125) internal successors, (99), 98 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2023-11-29 02:52:07,959 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 87 [2023-11-29 02:52:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:07,960 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2023-11-29 02:52:07,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2023-11-29 02:52:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 02:52:07,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:07,961 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, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:07,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:52:07,961 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:07,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2116857161, now seen corresponding path program 1 times [2023-11-29 02:52:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13958731] [2023-11-29 02:52:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13958731] [2023-11-29 02:52:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13958731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:08,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-29 02:52:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064421246] [2023-11-29 02:52:08,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:08,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 02:52:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:08,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:52:08,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:52:08,714 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:09,224 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2023-11-29 02:52:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:52:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2023-11-29 02:52:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:09,225 INFO L225 Difference]: With dead ends: 108 [2023-11-29 02:52:09,225 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 02:52:09,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2023-11-29 02:52:09,226 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 85 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:09,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 346 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:52:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 02:52:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2023-11-29 02:52:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2023-11-29 02:52:09,230 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 93 [2023-11-29 02:52:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:09,230 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2023-11-29 02:52:09,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2023-11-29 02:52:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 02:52:09,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:09,232 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, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:09,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:52:09,232 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:09,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2116871991, now seen corresponding path program 1 times [2023-11-29 02:52:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675577566] [2023-11-29 02:52:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:09,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:09,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675577566] [2023-11-29 02:52:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675577566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:09,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83333325] [2023-11-29 02:52:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:09,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:09,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:09,445 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:09,606 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2023-11-29 02:52:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:09,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2023-11-29 02:52:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:09,608 INFO L225 Difference]: With dead ends: 101 [2023-11-29 02:52:09,608 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 02:52:09,608 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 [2023-11-29 02:52:09,609 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 65 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:09,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 72 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:52:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 02:52:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-29 02:52:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2023-11-29 02:52:09,612 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 93 [2023-11-29 02:52:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:09,612 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2023-11-29 02:52:09,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2023-11-29 02:52:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 02:52:09,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:09,613 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, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:09,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:52:09,614 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:09,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2116871990, now seen corresponding path program 1 times [2023-11-29 02:52:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:09,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792475877] [2023-11-29 02:52:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:10,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792475877] [2023-11-29 02:52:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792475877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:10,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:10,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:52:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580253367] [2023-11-29 02:52:10,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:10,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:52:10,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:10,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:52:10,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:52:10,148 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:10,427 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2023-11-29 02:52:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:52:10,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2023-11-29 02:52:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:10,429 INFO L225 Difference]: With dead ends: 100 [2023-11-29 02:52:10,429 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 02:52:10,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:52:10,430 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 118 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:10,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 83 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:52:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 02:52:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-29 02:52:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2023-11-29 02:52:10,433 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 93 [2023-11-29 02:52:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:10,433 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2023-11-29 02:52:10,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2023-11-29 02:52:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 02:52:10,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:10,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:10,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 02:52:10,435 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:10,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash -589668726, now seen corresponding path program 1 times [2023-11-29 02:52:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:10,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242191887] [2023-11-29 02:52:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242191887] [2023-11-29 02:52:11,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242191887] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:52:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909999061] [2023-11-29 02:52:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:11,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:52:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:52:11,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:52:11,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:52:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:11,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:52:11,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:11,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:52:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909999061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:52:12,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:52:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 31 [2023-11-29 02:52:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615273815] [2023-11-29 02:52:12,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:52:12,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 02:52:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:12,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 02:52:12,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2023-11-29 02:52:12,226 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:19,676 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2023-11-29 02:52:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 02:52:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 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 99 [2023-11-29 02:52:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:19,678 INFO L225 Difference]: With dead ends: 175 [2023-11-29 02:52:19,678 INFO L226 Difference]: Without dead ends: 175 [2023-11-29 02:52:19,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=683, Invalid=1867, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 02:52:19,679 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 495 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:19,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 345 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:52:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-29 02:52:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2023-11-29 02:52:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0058479532163742) internal successors, (172), 171 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2023-11-29 02:52:19,682 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 99 [2023-11-29 02:52:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:19,682 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2023-11-29 02:52:19,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2023-11-29 02:52:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 02:52:19,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:19,684 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 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, 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, 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, 1, 1, 1, 1] [2023-11-29 02:52:19,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:52:19,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 02:52:19,885 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:52:19,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash 338242798, now seen corresponding path program 2 times [2023-11-29 02:52:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906585471] [2023-11-29 02:52:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906585471] [2023-11-29 02:52:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906585471] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:52:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700426831] [2023-11-29 02:52:21,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:52:21,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:52:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:52:21,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:52:21,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:52:22,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:52:22,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:52:22,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 02:52:22,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:22,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:52:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700426831] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:52:23,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:52:23,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 55 [2023-11-29 02:52:23,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082628556] [2023-11-29 02:52:23,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:52:23,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-29 02:52:23,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:23,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-29 02:52:23,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=2233, Unknown=0, NotChecked=0, Total=2970 [2023-11-29 02:52:23,791 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:36,481 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2023-11-29 02:53:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-29 02:53:36,481 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 0 states have call successors, (0), 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 171 [2023-11-29 02:53:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:36,483 INFO L225 Difference]: With dead ends: 295 [2023-11-29 02:53:36,483 INFO L226 Difference]: Without dead ends: 295 [2023-11-29 02:53:36,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 72.5s TimeCoverageRelationStatistics Valid=2207, Invalid=6722, Unknown=1, NotChecked=0, Total=8930 [2023-11-29 02:53:36,486 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 400 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:36,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1285 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3187 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:53:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-29 02:53:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2023-11-29 02:53:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.0034364261168385) internal successors, (292), 291 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2023-11-29 02:53:36,492 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 171 [2023-11-29 02:53:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:36,493 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2023-11-29 02:53:36,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2023-11-29 02:53:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2023-11-29 02:53:36,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:36,497 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 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, 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, 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, 1, 1, 1, 1] [2023-11-29 02:53:36,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:53:36,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 02:53:36,702 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 02:53:36,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1905767658, now seen corresponding path program 3 times [2023-11-29 02:53:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:36,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899980825] [2023-11-29 02:53:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 99 proven. 3168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:42,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899980825] [2023-11-29 02:53:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899980825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723767439] [2023-11-29 02:53:42,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:53:42,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:42,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:42,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:42,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:53:46,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 02:53:46,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:53:46,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 02:53:46,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:46,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 02:53:47,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:53:47,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 02:53:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 96 proven. 163 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2023-11-29 02:53:47,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:52,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 02:53:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2023-11-29 02:53:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723767439] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:53:52,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:53:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 11, 10] total 69 [2023-11-29 02:53:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639045497] [2023-11-29 02:53:52,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:53:52,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-29 02:53:52,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:52,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-29 02:53:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=4187, Unknown=0, NotChecked=0, Total=4692 [2023-11-29 02:53:52,510 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand has 69 states, 69 states have (on average 5.9855072463768115) internal successors, (413), 69 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:04,372 INFO L93 Difference]: Finished difference Result 286 states and 285 transitions. [2023-11-29 02:54:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-11-29 02:54:04,373 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 5.9855072463768115) internal successors, (413), 69 states have internal predecessors, (413), 0 states have call successors, (0), 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 291 [2023-11-29 02:54:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:04,373 INFO L225 Difference]: With dead ends: 286 [2023-11-29 02:54:04,373 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 02:54:04,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6339 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2472, Invalid=29390, Unknown=0, NotChecked=0, Total=31862 [2023-11-29 02:54:04,387 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 879 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 10988 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 11079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 10988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:04,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2206 Invalid, 11079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 10988 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 02:54:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 02:54:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 02:54:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 02:54:04,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2023-11-29 02:54:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:04,388 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:54:04,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 5.9855072463768115) internal successors, (413), 69 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:54:04,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 02:54:04,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 104 remaining) [2023-11-29 02:54:04,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 104 remaining) [2023-11-29 02:54:04,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 104 remaining) [2023-11-29 02:54:04,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 104 remaining) [2023-11-29 02:54:04,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 104 remaining) [2023-11-29 02:54:04,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 104 remaining) [2023-11-29 02:54:04,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 104 remaining) [2023-11-29 02:54:04,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 104 remaining) [2023-11-29 02:54:04,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 104 remaining) [2023-11-29 02:54:04,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 104 remaining) [2023-11-29 02:54:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK (1 of 104 remaining) [2023-11-29 02:54:04,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK (0 of 104 remaining) [2023-11-29 02:54:04,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:54:04,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:54:04,604 INFO L445 BasicCegarLoop]: Path program histogram: [3, 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] [2023-11-29 02:54:04,606 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:54:04,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:54:04 BoogieIcfgContainer [2023-11-29 02:54:04,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:54:04,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:54:04,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:54:04,610 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:54:04,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:51:54" (3/4) ... [2023-11-29 02:54:04,612 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:54:04,627 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2023-11-29 02:54:04,629 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-29 02:54:04,630 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 02:54:04,631 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-29 02:54:04,632 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:54:04,850 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:54:04,850 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:54:04,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:54:04,851 INFO L158 Benchmark]: Toolchain (without parser) took 132420.61ms. Allocated memory was 201.3MB in the beginning and 434.1MB in the end (delta: 232.8MB). Free memory was 168.5MB in the beginning and 149.5MB in the end (delta: 19.0MB). Peak memory consumption was 251.6MB. Max. memory is 16.1GB. [2023-11-29 02:54:04,851 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:54:04,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.55ms. Allocated memory is still 201.3MB. Free memory was 168.5MB in the beginning and 147.4MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:54:04,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.54ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 142.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:54:04,852 INFO L158 Benchmark]: Boogie Preprocessor took 92.87ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 135.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 02:54:04,852 INFO L158 Benchmark]: RCFGBuilder took 1091.57ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 156.3MB in the end (delta: -20.6MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2023-11-29 02:54:04,853 INFO L158 Benchmark]: TraceAbstraction took 130527.14ms. Allocated memory was 201.3MB in the beginning and 434.1MB in the end (delta: 232.8MB). Free memory was 155.3MB in the beginning and 172.5MB in the end (delta: -17.3MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. [2023-11-29 02:54:04,853 INFO L158 Benchmark]: Witness Printer took 240.09ms. Allocated memory is still 434.1MB. Free memory was 172.5MB in the beginning and 149.5MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:54:04,855 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.55ms. Allocated memory is still 201.3MB. Free memory was 168.5MB in the beginning and 147.4MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.54ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 142.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.87ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 135.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1091.57ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 156.3MB in the end (delta: -20.6MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * TraceAbstraction took 130527.14ms. Allocated memory was 201.3MB in the beginning and 434.1MB in the end (delta: 232.8MB). Free memory was 155.3MB in the beginning and 172.5MB in the end (delta: -17.3MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. * Witness Printer took 240.09ms. Allocated memory is still 434.1MB. Free memory was 172.5MB in the beginning and 149.5MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. 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: -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: -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: -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: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: 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, 202 locations, 104 error locations. Started 1 CEGAR loops. OverallTime: 130.5s, OverallIterations: 30, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 98.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5633 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5633 mSDsluCounter, 6370 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4910 mSDsCounter, 419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21848 IncrementalHoareTripleChecker+Invalid, 22267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 419 mSolverCounterUnsat, 1460 mSDtfsCounter, 21848 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1576 GetRequests, 1094 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7724 ImplicationChecksByTransitivity, 91.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=29, InterpolantAutomatonStates: 349, 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, 30 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 2758 NumberOfCodeBlocks, 2572 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3283 ConstructedInterpolants, 238 QuantifiedInterpolants, 24143 SizeOfPredicates, 21 NumberOfNonLiveVariables, 4344 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 36 InterpolantComputations, 27 PerfectInterpolantSequences, 6211/11331 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 104 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 02:54:04,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_415a1768-a562-4b05-8aa2-d18dd25d491d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE