./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU --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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:29,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:29,426 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:04:29,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:29,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:29,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:29,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:29,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:29,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:04:29,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:04:29,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:29,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:29,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:29,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:29,479 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:29,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:29,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:29,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:04:29,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:29,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:29,481 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:04:29,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:04:29,486 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:04:29,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:29,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:04:29,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:29,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:04:29,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:29,488 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:29,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:29,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:29,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:04:29,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:29,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:29,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:29,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:29,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:04:29,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:04:29,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:29,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:29,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:29,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:29,492 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_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/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_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2024-10-31 22:04:29,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:29,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:29,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:29,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:29,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:29,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i Unable to find full path for "g++" [2024-10-31 22:04:31,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:32,099 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:32,100 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-10-31 22:04:32,114 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/data/aa6764fa1/68ac9d4e93794270a2ffbe1c23dc4238/FLAGa4ea36189 [2024-10-31 22:04:32,373 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/data/aa6764fa1/68ac9d4e93794270a2ffbe1c23dc4238 [2024-10-31 22:04:32,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:32,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:32,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:32,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:32,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:32,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:32,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c19ae08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32, skipping insertion in model container [2024-10-31 22:04:32,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:32,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:32,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:32,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:32,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:32,937 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:32,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32 WrapperNode [2024-10-31 22:04:32,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:32,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:32,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:32,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:32,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:32,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:32,986 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2024-10-31 22:04:32,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:32,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:32,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:32,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:33,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,037 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-10-31 22:04:33,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:33,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:33,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:33,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:33,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (1/1) ... [2024-10-31 22:04:33,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:33,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:33,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:33,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-31 22:04:33,135 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-31 22:04:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:04:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:04:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:04:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:04:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:04:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:04:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:04:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:04:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:04:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:04:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:04:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:04:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:33,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:33,258 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:33,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:33,804 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-10-31 22:04:33,804 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:33,820 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:33,820 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-31 22:04:33,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:33 BoogieIcfgContainer [2024-10-31 22:04:33,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:33,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:33,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:33,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:33,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:32" (1/3) ... [2024-10-31 22:04:33,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cffef77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:33, skipping insertion in model container [2024-10-31 22:04:33,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:32" (2/3) ... [2024-10-31 22:04:33,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cffef77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:33, skipping insertion in model container [2024-10-31 22:04:33,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:33" (3/3) ... [2024-10-31 22:04:33,830 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2024-10-31 22:04:33,846 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:33,846 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-10-31 22:04:33,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:33,897 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@f85ec64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:33,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-10-31 22:04:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 101 states have (on average 2.108910891089109) internal successors, (213), 176 states have internal predecessors, (213), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-31 22:04:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:04:33,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:33,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:04:33,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:33,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-10-31 22:04:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:33,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773823101] [2024-10-31 22:04:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773823101] [2024-10-31 22:04:34,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773823101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:04:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485832928] [2024-10-31 22:04:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:34,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:34,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:34,191 INFO L87 Difference]: Start difference. First operand has 184 states, 101 states have (on average 2.108910891089109) internal successors, (213), 176 states have internal predecessors, (213), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:34,448 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2024-10-31 22:04:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-31 22:04:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:34,463 INFO L225 Difference]: With dead ends: 173 [2024-10-31 22:04:34,463 INFO L226 Difference]: Without dead ends: 171 [2024-10-31 22:04:34,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:34,470 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:34,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 124 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-31 22:04:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-31 22:04:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 93 states have (on average 1.946236559139785) internal successors, (181), 169 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2024-10-31 22:04:34,550 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 3 [2024-10-31 22:04:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:34,552 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2024-10-31 22:04:34,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2024-10-31 22:04:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:04:34,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:34,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:04:34,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:04:34,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:34,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-10-31 22:04:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611635123] [2024-10-31 22:04:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611635123] [2024-10-31 22:04:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611635123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:34,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:34,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:04:34,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623740440] [2024-10-31 22:04:34,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:34,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:34,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:34,694 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:34,891 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2024-10-31 22:04:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-31 22:04:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:34,894 INFO L225 Difference]: With dead ends: 168 [2024-10-31 22:04:34,898 INFO L226 Difference]: Without dead ends: 168 [2024-10-31 22:04:34,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:34,900 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:34,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 120 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-31 22:04:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-31 22:04:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 93 states have (on average 1.913978494623656) internal successors, (178), 166 states have internal predecessors, (178), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2024-10-31 22:04:34,915 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 3 [2024-10-31 22:04:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2024-10-31 22:04:34,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2024-10-31 22:04:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:04:34,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:34,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:34,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:04:34,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash 919164531, now seen corresponding path program 1 times [2024-10-31 22:04:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71346345] [2024-10-31 22:04:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71346345] [2024-10-31 22:04:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71346345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:35,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:35,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740461058] [2024-10-31 22:04:35,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:35,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:35,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:35,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:35,237 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:35,538 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2024-10-31 22:04:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:35,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-31 22:04:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:35,540 INFO L225 Difference]: With dead ends: 166 [2024-10-31 22:04:35,541 INFO L226 Difference]: Without dead ends: 166 [2024-10-31 22:04:35,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:35,542 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 245 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:35,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 95 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:04:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-31 22:04:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-10-31 22:04:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.7289719626168225) internal successors, (185), 162 states have internal predecessors, (185), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2024-10-31 22:04:35,553 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 9 [2024-10-31 22:04:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:35,553 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2024-10-31 22:04:35,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2024-10-31 22:04:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:04:35,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:35,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:35,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:04:35,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:35,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 919164532, now seen corresponding path program 1 times [2024-10-31 22:04:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333581228] [2024-10-31 22:04:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333581228] [2024-10-31 22:04:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333581228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:04:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616178706] [2024-10-31 22:04:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:35,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:04:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:04:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:35,857 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:36,386 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2024-10-31 22:04:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-31 22:04:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:36,389 INFO L225 Difference]: With dead ends: 236 [2024-10-31 22:04:36,389 INFO L226 Difference]: Without dead ends: 236 [2024-10-31 22:04:36,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:04:36,391 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 598 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:36,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 134 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:04:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-31 22:04:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2024-10-31 22:04:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.625) internal successors, (260), 215 states have internal predecessors, (260), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 266 transitions. [2024-10-31 22:04:36,405 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 266 transitions. Word has length 9 [2024-10-31 22:04:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:36,406 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 266 transitions. [2024-10-31 22:04:36,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 266 transitions. [2024-10-31 22:04:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 22:04:36,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:36,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:36,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:04:36,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:36,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1801951228, now seen corresponding path program 1 times [2024-10-31 22:04:36,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:36,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469829634] [2024-10-31 22:04:36,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:36,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:36,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469829634] [2024-10-31 22:04:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469829634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071251966] [2024-10-31 22:04:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:36,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:36,448 INFO L87 Difference]: Start difference. First operand 217 states and 266 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:36,476 INFO L93 Difference]: Finished difference Result 263 states and 315 transitions. [2024-10-31 22:04:36,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:36,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-31 22:04:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:36,478 INFO L225 Difference]: With dead ends: 263 [2024-10-31 22:04:36,478 INFO L226 Difference]: Without dead ends: 263 [2024-10-31 22:04:36,478 INFO L431 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 [2024-10-31 22:04:36,480 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 56 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:36,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 338 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-31 22:04:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2024-10-31 22:04:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.6184971098265897) internal successors, (280), 228 states have internal predecessors, (280), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2024-10-31 22:04:36,494 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 13 [2024-10-31 22:04:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:36,494 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2024-10-31 22:04:36,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2024-10-31 22:04:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 22:04:36,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:36,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:36,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:04:36,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-10-31 22:04:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:36,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551018200] [2024-10-31 22:04:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551018200] [2024-10-31 22:04:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551018200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:36,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:36,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:36,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703629084] [2024-10-31 22:04:36,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:36,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:36,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:36,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:36,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:36,650 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:36,893 INFO L93 Difference]: Finished difference Result 229 states and 283 transitions. [2024-10-31 22:04:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:36,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-31 22:04:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:36,896 INFO L225 Difference]: With dead ends: 229 [2024-10-31 22:04:36,900 INFO L226 Difference]: Without dead ends: 229 [2024-10-31 22:04:36,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:36,901 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 4 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:36,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 434 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-31 22:04:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-31 22:04:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 173 states have (on average 1.6011560693641618) internal successors, (277), 227 states have internal predecessors, (277), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 283 transitions. [2024-10-31 22:04:36,916 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 283 transitions. Word has length 12 [2024-10-31 22:04:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:36,916 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 283 transitions. [2024-10-31 22:04:36,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 283 transitions. [2024-10-31 22:04:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 22:04:36,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:36,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:36,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:04:36,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:36,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:36,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-10-31 22:04:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426772253] [2024-10-31 22:04:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:37,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426772253] [2024-10-31 22:04:37,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426772253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:37,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:37,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189822590] [2024-10-31 22:04:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:37,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:37,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:37,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:37,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:37,137 INFO L87 Difference]: Start difference. First operand 229 states and 283 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:37,402 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2024-10-31 22:04:37,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:37,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-31 22:04:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:37,404 INFO L225 Difference]: With dead ends: 228 [2024-10-31 22:04:37,404 INFO L226 Difference]: Without dead ends: 228 [2024-10-31 22:04:37,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:37,407 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:37,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 414 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-31 22:04:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-10-31 22:04:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 173 states have (on average 1.583815028901734) internal successors, (274), 226 states have internal predecessors, (274), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2024-10-31 22:04:37,422 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 12 [2024-10-31 22:04:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:37,422 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2024-10-31 22:04:37,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2024-10-31 22:04:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-31 22:04:37,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:37,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:37,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:04:37,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-10-31 22:04:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688341365] [2024-10-31 22:04:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688341365] [2024-10-31 22:04:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688341365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:37,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:37,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:04:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494422070] [2024-10-31 22:04:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:37,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:04:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:04:37,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:04:37,789 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:38,405 INFO L93 Difference]: Finished difference Result 227 states and 278 transitions. [2024-10-31 22:04:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:04:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-31 22:04:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:38,406 INFO L225 Difference]: With dead ends: 227 [2024-10-31 22:04:38,407 INFO L226 Difference]: Without dead ends: 227 [2024-10-31 22:04:38,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:04:38,408 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 237 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:38,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 397 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:04:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-31 22:04:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-10-31 22:04:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 173 states have (on average 1.5722543352601157) internal successors, (272), 225 states have internal predecessors, (272), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2024-10-31 22:04:38,415 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 16 [2024-10-31 22:04:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:38,415 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2024-10-31 22:04:38,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2024-10-31 22:04:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-31 22:04:38,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:38,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:38,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:04:38,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-10-31 22:04:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:38,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474849736] [2024-10-31 22:04:38,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:38,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:38,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:38,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474849736] [2024-10-31 22:04:38,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474849736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:04:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652370673] [2024-10-31 22:04:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:38,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:04:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:04:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:04:38,835 INFO L87 Difference]: Start difference. First operand 227 states and 278 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:39,681 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2024-10-31 22:04:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:04:39,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-31 22:04:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:39,683 INFO L225 Difference]: With dead ends: 221 [2024-10-31 22:04:39,684 INFO L226 Difference]: Without dead ends: 221 [2024-10-31 22:04:39,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-31 22:04:39,687 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 245 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:39,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 409 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:04:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-31 22:04:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 213. [2024-10-31 22:04:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 165 states have (on average 1.5393939393939393) internal successors, (254), 211 states have internal predecessors, (254), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 260 transitions. [2024-10-31 22:04:39,696 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 260 transitions. Word has length 16 [2024-10-31 22:04:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:39,697 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 260 transitions. [2024-10-31 22:04:39,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 260 transitions. [2024-10-31 22:04:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:04:39,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:39,699 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:04:39,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:04:39,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:39,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1826649493, now seen corresponding path program 1 times [2024-10-31 22:04:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:39,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475906122] [2024-10-31 22:04:39,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:04:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475906122] [2024-10-31 22:04:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475906122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:39,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024391005] [2024-10-31 22:04:39,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:39,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:39,789 INFO L87 Difference]: Start difference. First operand 213 states and 260 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:40,004 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2024-10-31 22:04:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:40,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-31 22:04:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:40,005 INFO L225 Difference]: With dead ends: 236 [2024-10-31 22:04:40,005 INFO L226 Difference]: Without dead ends: 236 [2024-10-31 22:04:40,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:40,006 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 265 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:40,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 213 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-31 22:04:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 212. [2024-10-31 22:04:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.5212121212121212) internal successors, (251), 210 states have internal predecessors, (251), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 256 transitions. [2024-10-31 22:04:40,012 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 256 transitions. Word has length 27 [2024-10-31 22:04:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:40,012 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 256 transitions. [2024-10-31 22:04:40,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 256 transitions. [2024-10-31 22:04:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-31 22:04:40,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:40,014 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:04:40,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:04:40,014 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:40,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash 477037051, now seen corresponding path program 1 times [2024-10-31 22:04:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:40,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490486499] [2024-10-31 22:04:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:40,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490486499] [2024-10-31 22:04:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490486499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:04:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508356174] [2024-10-31 22:04:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:40,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:04:40,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:40,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:04:40,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:04:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:40,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-31 22:04:40,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:04:40,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-31 22:04:41,059 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-31 22:04:41,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-31 22:04:41,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:04:41,317 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:04:41,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-31 22:04:41,509 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-31 22:04:41,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-31 22:04:41,601 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:04:41,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-31 22:04:41,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2024-10-31 22:04:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:41,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:04:42,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_73| Int) (v_ArrVal_334 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_73| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_73|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_73|))) is different from false [2024-10-31 22:04:42,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_73| Int) (v_ArrVal_334 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_73| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_73|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_73|))) is different from false [2024-10-31 22:04:42,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:42,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-10-31 22:04:42,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:42,455 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 144 treesize of output 131 [2024-10-31 22:04:42,472 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 80 treesize of output 76 [2024-10-31 22:04:42,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:42,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 76 treesize of output 74 [2024-10-31 22:04:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508356174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:04:46,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:04:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2024-10-31 22:04:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145804509] [2024-10-31 22:04:46,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:04:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-31 22:04:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-31 22:04:46,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=839, Unknown=9, NotChecked=122, Total=1122 [2024-10-31 22:04:46,633 INFO L87 Difference]: Start difference. First operand 212 states and 256 transitions. Second operand has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 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) [2024-10-31 22:04:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:48,888 INFO L93 Difference]: Finished difference Result 320 states and 364 transitions. [2024-10-31 22:04:48,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:04:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 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 31 [2024-10-31 22:04:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:48,892 INFO L225 Difference]: With dead ends: 320 [2024-10-31 22:04:48,892 INFO L226 Difference]: Without dead ends: 320 [2024-10-31 22:04:48,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=261, Invalid=1220, Unknown=9, NotChecked=150, Total=1640 [2024-10-31 22:04:48,893 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 635 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 651 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:48,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1235 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1566 Invalid, 0 Unknown, 651 Unchecked, 1.9s Time] [2024-10-31 22:04:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-31 22:04:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 237. [2024-10-31 22:04:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 235 states have internal predecessors, (281), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 286 transitions. [2024-10-31 22:04:48,900 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 286 transitions. Word has length 31 [2024-10-31 22:04:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:48,901 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 286 transitions. [2024-10-31 22:04:48,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 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) [2024-10-31 22:04:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 286 transitions. [2024-10-31 22:04:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-31 22:04:48,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:48,903 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:04:48,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:04:49,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:04:49,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:49,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 477037052, now seen corresponding path program 1 times [2024-10-31 22:04:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219541286] [2024-10-31 22:04:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219541286] [2024-10-31 22:04:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219541286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:04:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645879319] [2024-10-31 22:04:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:49,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:04:49,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:49,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:04:49,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:04:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:50,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-31 22:04:50,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:04:50,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-31 22:04:50,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-31 22:04:50,182 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:04:50,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-10-31 22:04:50,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 22:04:50,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:04:50,392 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:04:50,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:04:50,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-31 22:04:50,539 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-31 22:04:50,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-31 22:04:50,561 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-31 22:04:50,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-31 22:04:50,676 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:04:50,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:04:50,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-31 22:04:50,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2024-10-31 22:04:50,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-31 22:04:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:50,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:04:51,723 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) (forall ((v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))))))) is different from false [2024-10-31 22:04:51,789 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_433) .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)))))))) is different from false [2024-10-31 22:04:51,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_434))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) .cse1 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))))))))) is different from false [2024-10-31 22:04:51,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-10-31 22:04:51,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:51,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-10-31 22:04:51,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:51,923 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 632 treesize of output 567 [2024-10-31 22:04:51,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:51,980 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 1831 treesize of output 1742 [2024-10-31 22:04:52,061 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 547 treesize of output 523 [2024-10-31 22:04:52,082 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 523 treesize of output 499 [2024-10-31 22:04:52,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:52,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 499 treesize of output 455 [2024-10-31 22:04:52,140 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 447 treesize of output 439 [2024-10-31 22:04:54,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:54,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-31 22:04:54,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:04:54,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-31 22:04:54,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:04:54,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2024-10-31 22:04:54,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:04:54,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:04:54,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:04:54,585 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-31 22:04:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645879319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:04:54,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:04:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-10-31 22:04:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938462223] [2024-10-31 22:04:54,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:04:54,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-31 22:04:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-31 22:04:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=938, Unknown=9, NotChecked=192, Total=1260 [2024-10-31 22:04:54,904 INFO L87 Difference]: Start difference. First operand 237 states and 286 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:57,426 INFO L93 Difference]: Finished difference Result 311 states and 355 transitions. [2024-10-31 22:04:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:04:57,427 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 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 31 [2024-10-31 22:04:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:57,428 INFO L225 Difference]: With dead ends: 311 [2024-10-31 22:04:57,429 INFO L226 Difference]: Without dead ends: 311 [2024-10-31 22:04:57,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=278, Invalid=1531, Unknown=9, NotChecked=252, Total=2070 [2024-10-31 22:04:57,430 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 765 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 931 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:57,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1117 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1612 Invalid, 0 Unknown, 931 Unchecked, 1.9s Time] [2024-10-31 22:04:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-31 22:04:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 237. [2024-10-31 22:04:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 235 states have internal predecessors, (280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2024-10-31 22:04:57,439 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 31 [2024-10-31 22:04:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:57,439 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2024-10-31 22:04:57,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2024-10-31 22:04:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-31 22:04:57,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:57,442 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:04:57,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:04:57,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ea2dafb-c6b2-481a-ab4f-4e3e9f80d18b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:04:57,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:57,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1120151479, now seen corresponding path program 1 times [2024-10-31 22:04:57,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:57,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455121669] [2024-10-31 22:04:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:04:57,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455121669] [2024-10-31 22:04:57,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455121669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:57,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:57,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:57,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555487415] [2024-10-31 22:04:57,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:57,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:57,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:57,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:57,703 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:57,716 INFO L93 Difference]: Finished difference Result 239 states and 287 transitions. [2024-10-31 22:04:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:57,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-31 22:04:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:57,718 INFO L225 Difference]: With dead ends: 239 [2024-10-31 22:04:57,718 INFO L226 Difference]: Without dead ends: 239 [2024-10-31 22:04:57,718 INFO L431 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 [2024-10-31 22:04:57,719 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:57,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-31 22:04:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-31 22:04:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 192 states have (on average 1.46875) internal successors, (282), 237 states have internal predecessors, (282), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2024-10-31 22:04:57,727 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 33 [2024-10-31 22:04:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:57,727 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2024-10-31 22:04:57,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2024-10-31 22:04:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-31 22:04:57,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:57,729 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:04:57,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:04:57,730 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:57,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1231280740, now seen corresponding path program 1 times [2024-10-31 22:04:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551290039] [2024-10-31 22:04:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:04:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551290039] [2024-10-31 22:04:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551290039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:57,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:04:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616997190] [2024-10-31 22:04:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:57,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:04:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:04:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:57,862 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:58,199 INFO L93 Difference]: Finished difference Result 258 states and 315 transitions. [2024-10-31 22:04:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:04:58,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-31 22:04:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:58,201 INFO L225 Difference]: With dead ends: 258 [2024-10-31 22:04:58,201 INFO L226 Difference]: Without dead ends: 258 [2024-10-31 22:04:58,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:04:58,202 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:58,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 359 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:04:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-31 22:04:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2024-10-31 22:04:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 192 states have (on average 1.4635416666666667) internal successors, (281), 236 states have internal predecessors, (281), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 286 transitions. [2024-10-31 22:04:58,208 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 286 transitions. Word has length 36 [2024-10-31 22:04:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:58,209 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 286 transitions. [2024-10-31 22:04:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 286 transitions. [2024-10-31 22:04:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-31 22:04:58,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:58,211 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:04:58,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:04:58,212 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-10-31 22:04:58,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1231280739, now seen corresponding path program 1 times [2024-10-31 22:04:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90305056] [2024-10-31 22:04:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat