./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 18:38:49,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 18:38:49,361 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-23 18:38:49,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 18:38:49,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 18:38:49,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 18:38:49,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 18:38:49,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 18:38:49,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 18:38:49,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 18:38:49,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 18:38:49,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 18:38:49,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 18:38:49,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 18:38:49,432 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 18:38:49,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 18:38:49,433 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 18:38:49,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 18:38:49,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 18:38:49,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 18:38:49,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 18:38:49,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 18:38:49,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:38:49,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:38:49,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:38:49,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:38:49,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 18:38:49,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:38:49,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:38:49,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:38:49,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:38:49,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 18:38:49,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 18:38:49,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 18:38:49,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 18:38:49,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 18:38:49,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 18:38:49,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 18:38:49,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 18:38:49,438 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2024-11-23 18:38:49,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 18:38:49,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 18:38:49,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 18:38:49,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 18:38:49,889 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 18:38:49,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-23 18:38:53,549 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/data/df1e47df0/f103d33cab684edb892044b2780c6a2d/FLAGa374eb6d2 [2024-11-23 18:38:54,094 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 18:38:54,097 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-23 18:38:54,119 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/data/df1e47df0/f103d33cab684edb892044b2780c6a2d/FLAGa374eb6d2 [2024-11-23 18:38:54,144 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/data/df1e47df0/f103d33cab684edb892044b2780c6a2d [2024-11-23 18:38:54,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 18:38:54,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 18:38:54,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 18:38:54,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 18:38:54,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 18:38:54,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d0666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54, skipping insertion in model container [2024-11-23 18:38:54,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 18:38:54,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:38:54,713 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 18:38:54,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:38:54,807 INFO L204 MainTranslator]: Completed translation [2024-11-23 18:38:54,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54 WrapperNode [2024-11-23 18:38:54,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 18:38:54,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 18:38:54,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 18:38:54,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 18:38:54,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,870 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2024-11-23 18:38:54,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 18:38:54,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 18:38:54,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 18:38:54,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 18:38:54,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,925 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-23 18:38:54,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 18:38:54,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 18:38:54,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 18:38:54,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 18:38:54,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (1/1) ... [2024-11-23 18:38:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:38:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:38:55,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 18:38:55,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 18:38:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 18:38:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 18:38:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 18:38:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 18:38:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 18:38:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 18:38:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 18:38:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 18:38:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 18:38:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 18:38:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 18:38:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 18:38:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 18:38:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 18:38:55,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 18:38:55,290 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 18:38:55,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 18:38:55,739 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-23 18:38:55,739 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 18:38:55,760 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 18:38:55,760 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-23 18:38:55,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:55 BoogieIcfgContainer [2024-11-23 18:38:55,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 18:38:55,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 18:38:55,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 18:38:55,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 18:38:55,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:38:54" (1/3) ... [2024-11-23 18:38:55,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dcd54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:55, skipping insertion in model container [2024-11-23 18:38:55,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:54" (2/3) ... [2024-11-23 18:38:55,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dcd54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:55, skipping insertion in model container [2024-11-23 18:38:55,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:55" (3/3) ... [2024-11-23 18:38:55,780 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2024-11-23 18:38:55,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 18:38:55,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all_reverse.i that has 1 procedures, 67 locations, 1 initial locations, 6 loop locations, and 21 error locations. [2024-11-23 18:38:55,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 18:38:55,888 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;@5c0d0836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 18:38:55,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-23 18:38:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-23 18:38:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-23 18:38:55,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:55,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 18:38:55,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:55,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash 889601162, now seen corresponding path program 1 times [2024-11-23 18:38:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:55,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606596648] [2024-11-23 18:38:55,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606596648] [2024-11-23 18:38:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606596648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:38:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:38:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 18:38:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355054659] [2024-11-23 18:38:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:38:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 18:38:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:56,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 18:38:56,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:38:56,213 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:38:56,314 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-23 18:38:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 18:38:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-23 18:38:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:38:56,329 INFO L225 Difference]: With dead ends: 64 [2024-11-23 18:38:56,329 INFO L226 Difference]: Without dead ends: 61 [2024-11-23 18:38:56,332 INFO L434 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-11-23 18:38:56,337 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:38:56,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:38:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-23 18:38:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-23 18:38:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-23 18:38:56,377 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 6 [2024-11-23 18:38:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:38:56,378 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-23 18:38:56,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-23 18:38:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-23 18:38:56,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:56,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 18:38:56,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 18:38:56,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:56,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash 889601163, now seen corresponding path program 1 times [2024-11-23 18:38:56,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:56,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520817784] [2024-11-23 18:38:56,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520817784] [2024-11-23 18:38:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520817784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:38:56,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:38:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 18:38:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193796680] [2024-11-23 18:38:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:38:56,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 18:38:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:56,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 18:38:56,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:38:56,532 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:38:56,610 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-23 18:38:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 18:38:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-23 18:38:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:38:56,615 INFO L225 Difference]: With dead ends: 59 [2024-11-23 18:38:56,616 INFO L226 Difference]: Without dead ends: 59 [2024-11-23 18:38:56,616 INFO L434 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-11-23 18:38:56,617 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:38:56,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:38:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-23 18:38:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-23 18:38:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-23 18:38:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-23 18:38:56,671 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 6 [2024-11-23 18:38:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:38:56,672 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-23 18:38:56,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-23 18:38:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-23 18:38:56,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:56,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:38:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 18:38:56,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash 346343986, now seen corresponding path program 1 times [2024-11-23 18:38:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951463464] [2024-11-23 18:38:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:56,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951463464] [2024-11-23 18:38:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951463464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:38:56,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:38:56,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 18:38:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293086045] [2024-11-23 18:38:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:38:56,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 18:38:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:56,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 18:38:56,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:38:56,769 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-23 18:38:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:38:56,795 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-23 18:38:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 18:38:56,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-23 18:38:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:38:56,801 INFO L225 Difference]: With dead ends: 70 [2024-11-23 18:38:56,801 INFO L226 Difference]: Without dead ends: 70 [2024-11-23 18:38:56,802 INFO L434 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-11-23 18:38:56,803 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:38:56,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:38:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-23 18:38:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-23 18:38:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 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-11-23 18:38:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-23 18:38:56,817 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 9 [2024-11-23 18:38:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:38:56,817 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-23 18:38:56,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-23 18:38:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-23 18:38:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 18:38:56,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:56,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:38:56,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 18:38:56,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:56,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1759663698, now seen corresponding path program 1 times [2024-11-23 18:38:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335050613] [2024-11-23 18:38:56,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:56,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335050613] [2024-11-23 18:38:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335050613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:38:56,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:38:56,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 18:38:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261217168] [2024-11-23 18:38:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:38:56,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:38:56,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:56,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:38:56,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:38:56,991 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-11-23 18:38:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:38:57,159 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-23 18:38:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 18:38:57,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-23 18:38:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:38:57,164 INFO L225 Difference]: With dead ends: 59 [2024-11-23 18:38:57,168 INFO L226 Difference]: Without dead ends: 59 [2024-11-23 18:38:57,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:38:57,169 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:38:57,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:38:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-23 18:38:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-23 18:38:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-23 18:38:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-23 18:38:57,178 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 10 [2024-11-23 18:38:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:38:57,183 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-23 18:38:57,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-11-23 18:38:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-23 18:38:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 18:38:57,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:57,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:38:57,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 18:38:57,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:57,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1759663697, now seen corresponding path program 1 times [2024-11-23 18:38:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:57,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366684515] [2024-11-23 18:38:57,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366684515] [2024-11-23 18:38:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366684515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:38:57,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:38:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 18:38:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181876085] [2024-11-23 18:38:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:38:57,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:38:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:57,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:38:57,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:38:57,466 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-11-23 18:38:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:38:57,596 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-23 18:38:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 18:38:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-23 18:38:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:38:57,600 INFO L225 Difference]: With dead ends: 58 [2024-11-23 18:38:57,600 INFO L226 Difference]: Without dead ends: 58 [2024-11-23 18:38:57,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:38:57,601 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:38:57,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:38:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-23 18:38:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-23 18:38:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-23 18:38:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-23 18:38:57,615 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 10 [2024-11-23 18:38:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:38:57,615 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-23 18:38:57,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-11-23 18:38:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-23 18:38:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-23 18:38:57,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:57,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:38:57,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 18:38:57,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:57,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash -698202142, now seen corresponding path program 1 times [2024-11-23 18:38:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977953106] [2024-11-23 18:38:57,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977953106] [2024-11-23 18:38:57,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977953106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:38:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105345312] [2024-11-23 18:38:57,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:57,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:38:57,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:38:57,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:38:57,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 18:38:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:58,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 18:38:58,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:38:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:58,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:38:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:38:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105345312] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:38:58,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:38:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-23 18:38:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945512803] [2024-11-23 18:38:58,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:38:58,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:38:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:58,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:38:58,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:38:58,154 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:38:58,182 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-23 18:38:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 18:38:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-23 18:38:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:38:58,184 INFO L225 Difference]: With dead ends: 67 [2024-11-23 18:38:58,184 INFO L226 Difference]: Without dead ends: 67 [2024-11-23 18:38:58,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:38:58,186 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:38:58,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:38:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-23 18:38:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-23 18:38:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-23 18:38:58,199 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 18 [2024-11-23 18:38:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:38:58,199 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-23 18:38:58,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-23 18:38:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-23 18:38:58,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:58,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:38:58,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 18:38:58,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:38:58,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319118, now seen corresponding path program 2 times [2024-11-23 18:38:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:58,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277484523] [2024-11-23 18:38:58,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:38:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:58,444 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:38:58,444 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:38:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 18:38:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277484523] [2024-11-23 18:38:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277484523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:38:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:38:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 18:38:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310882948] [2024-11-23 18:38:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:38:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 18:38:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:58,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 18:38:58,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:38:58,688 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:38:59,021 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-23 18:38:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 18:38:59,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-23 18:38:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:38:59,023 INFO L225 Difference]: With dead ends: 70 [2024-11-23 18:38:59,023 INFO L226 Difference]: Without dead ends: 70 [2024-11-23 18:38:59,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-23 18:38:59,024 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:38:59,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 247 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 18:38:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-23 18:38:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-23 18:38:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-23 18:38:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-23 18:38:59,037 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 27 [2024-11-23 18:38:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:38:59,038 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-23 18:38:59,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:38:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-23 18:38:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-23 18:38:59,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:38:59,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:38:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 18:38:59,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:38:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:38:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319117, now seen corresponding path program 1 times [2024-11-23 18:38:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:38:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119674207] [2024-11-23 18:38:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:38:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:38:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:38:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 18:38:59,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:38:59,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119674207] [2024-11-23 18:38:59,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119674207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:38:59,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:38:59,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 18:38:59,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084002693] [2024-11-23 18:38:59,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:38:59,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 18:38:59,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:38:59,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 18:38:59,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-23 18:38:59,690 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:00,103 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-23 18:39:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 18:39:00,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-23 18:39:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:00,110 INFO L225 Difference]: With dead ends: 70 [2024-11-23 18:39:00,110 INFO L226 Difference]: Without dead ends: 70 [2024-11-23 18:39:00,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-23 18:39:00,112 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:00,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 331 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 18:39:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-23 18:39:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-23 18:39:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 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-11-23 18:39:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-23 18:39:00,127 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 27 [2024-11-23 18:39:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:00,127 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-23 18:39:00,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-23 18:39:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 18:39:00,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:00,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:00,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 18:39:00,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1983181814, now seen corresponding path program 1 times [2024-11-23 18:39:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934172498] [2024-11-23 18:39:00,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:39:00,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:00,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934172498] [2024-11-23 18:39:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934172498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:00,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 18:39:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978239744] [2024-11-23 18:39:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:00,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 18:39:00,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:00,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 18:39:00,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 18:39:00,339 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:00,392 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-23 18:39:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 18:39:00,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-23 18:39:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:00,393 INFO L225 Difference]: With dead ends: 101 [2024-11-23 18:39:00,393 INFO L226 Difference]: Without dead ends: 101 [2024-11-23 18:39:00,393 INFO L434 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-11-23 18:39:00,394 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 107 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:00,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:39:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-23 18:39:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2024-11-23 18:39:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-23 18:39:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-23 18:39:00,409 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 29 [2024-11-23 18:39:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:00,409 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-23 18:39:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-23 18:39:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-23 18:39:00,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:00,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:00,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 18:39:00,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash 428474865, now seen corresponding path program 1 times [2024-11-23 18:39:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280676703] [2024-11-23 18:39:00,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 18:39:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280676703] [2024-11-23 18:39:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280676703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838825202] [2024-11-23 18:39:00,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:00,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:00,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:00,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:00,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 18:39:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:01,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 18:39:01,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:39:01,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:39:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838825202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:01,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 18:39:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2024-11-23 18:39:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435656567] [2024-11-23 18:39:01,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:01,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 18:39:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:01,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 18:39:01,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:39:01,117 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:01,207 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-23 18:39:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:39:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-23 18:39:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:01,209 INFO L225 Difference]: With dead ends: 69 [2024-11-23 18:39:01,210 INFO L226 Difference]: Without dead ends: 69 [2024-11-23 18:39:01,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-23 18:39:01,212 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 72 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:01,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 122 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:39:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-23 18:39:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-23 18:39:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-23 18:39:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-23 18:39:01,222 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 30 [2024-11-23 18:39:01,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:01,223 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-23 18:39:01,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-23 18:39:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-23 18:39:01,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:01,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:01,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 18:39:01,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:01,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:01,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:01,431 INFO L85 PathProgramCache]: Analyzing trace with hash 428474934, now seen corresponding path program 1 times [2024-11-23 18:39:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493167201] [2024-11-23 18:39:01,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:39:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493167201] [2024-11-23 18:39:02,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493167201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:02,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59507126] [2024-11-23 18:39:02,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:02,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:02,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 18:39:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:02,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-23 18:39:02,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:02,860 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 18:39:02,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2024-11-23 18:39:03,032 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 19 treesize of output 1 [2024-11-23 18:39:03,346 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 31 treesize of output 13 [2024-11-23 18:39:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:39:03,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:39:03,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59507126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:03,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:03,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 32 [2024-11-23 18:39:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331159833] [2024-11-23 18:39:03,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:03,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-23 18:39:03,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:03,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-23 18:39:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2024-11-23 18:39:03,922 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:04,956 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-23 18:39:04,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 18:39:04,957 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-23 18:39:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:04,959 INFO L225 Difference]: With dead ends: 80 [2024-11-23 18:39:04,959 INFO L226 Difference]: Without dead ends: 80 [2024-11-23 18:39:04,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2024-11-23 18:39:04,962 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:04,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 716 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-23 18:39:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-23 18:39:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-23 18:39:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-11-23 18:39:04,967 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2024-11-23 18:39:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:04,968 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-11-23 18:39:04,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-23 18:39:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-23 18:39:04,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:04,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:04,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 18:39:05,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:05,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:05,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 428474935, now seen corresponding path program 1 times [2024-11-23 18:39:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:05,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283658077] [2024-11-23 18:39:05,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:39:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:06,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283658077] [2024-11-23 18:39:06,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283658077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:06,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852409380] [2024-11-23 18:39:06,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:06,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:06,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:06,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 18:39:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:06,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-23 18:39:06,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:06,549 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-11-23 18:39:06,776 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:39:06,776 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-11-23 18:39:06,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-23 18:39:06,987 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 19 treesize of output 1 [2024-11-23 18:39:06,999 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 13 treesize of output 9 [2024-11-23 18:39:07,399 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 31 treesize of output 13 [2024-11-23 18:39:07,414 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 9 treesize of output 3 [2024-11-23 18:39:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:39:07,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:08,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:08,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-23 18:39:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:39:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852409380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:08,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 40 [2024-11-23 18:39:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618415208] [2024-11-23 18:39:08,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:08,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-23 18:39:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:08,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-23 18:39:08,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2024-11-23 18:39:08,830 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 0 states have call successors, (0), 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-11-23 18:39:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:10,909 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-11-23 18:39:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 18:39:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 0 states have call successors, (0), 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 30 [2024-11-23 18:39:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:10,911 INFO L225 Difference]: With dead ends: 81 [2024-11-23 18:39:10,911 INFO L226 Difference]: Without dead ends: 81 [2024-11-23 18:39:10,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=243, Invalid=2619, Unknown=0, NotChecked=0, Total=2862 [2024-11-23 18:39:10,914 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 76 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:10,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 899 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-23 18:39:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-23 18:39:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2024-11-23 18:39:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 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-11-23 18:39:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-23 18:39:10,922 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 30 [2024-11-23 18:39:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:10,922 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-23 18:39:10,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 0 states have call successors, (0), 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-11-23 18:39:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-23 18:39:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-23 18:39:10,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:10,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:10,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 18:39:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:11,124 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash -99859533, now seen corresponding path program 1 times [2024-11-23 18:39:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694426023] [2024-11-23 18:39:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-23 18:39:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694426023] [2024-11-23 18:39:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694426023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:11,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 18:39:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024569299] [2024-11-23 18:39:11,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 18:39:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:11,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 18:39:11,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:39:11,307 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:11,520 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-23 18:39:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 18:39:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-23 18:39:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:11,521 INFO L225 Difference]: With dead ends: 76 [2024-11-23 18:39:11,521 INFO L226 Difference]: Without dead ends: 76 [2024-11-23 18:39:11,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-23 18:39:11,522 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:11,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 233 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:39:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-23 18:39:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-23 18:39:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 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-11-23 18:39:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-23 18:39:11,526 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 34 [2024-11-23 18:39:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:11,527 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-23 18:39:11,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-23 18:39:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-23 18:39:11,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:11,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:11,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 18:39:11,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:11,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -99859532, now seen corresponding path program 1 times [2024-11-23 18:39:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:11,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155618403] [2024-11-23 18:39:11,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 18:39:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155618403] [2024-11-23 18:39:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155618403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597408689] [2024-11-23 18:39:11,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:11,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:11,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:11,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 18:39:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:11,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 18:39:11,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:39:11,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:39:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597408689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 18:39:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-23 18:39:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084710771] [2024-11-23 18:39:11,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:11,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:39:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:11,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:39:11,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:39:11,945 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:12,015 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2024-11-23 18:39:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:39:12,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-23 18:39:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:12,017 INFO L225 Difference]: With dead ends: 97 [2024-11-23 18:39:12,017 INFO L226 Difference]: Without dead ends: 97 [2024-11-23 18:39:12,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-23 18:39:12,018 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:12,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 144 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:39:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-23 18:39:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2024-11-23 18:39:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.3125) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 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-11-23 18:39:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-23 18:39:12,022 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 34 [2024-11-23 18:39:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:12,022 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-23 18:39:12,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-23 18:39:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-23 18:39:12,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:12,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:12,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 18:39:12,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:12,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:12,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash -807088875, now seen corresponding path program 1 times [2024-11-23 18:39:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669335728] [2024-11-23 18:39:12,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 18:39:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669335728] [2024-11-23 18:39:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669335728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064954557] [2024-11-23 18:39:12,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:12,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:12,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:12,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:12,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 18:39:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:12,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 18:39:12,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 18:39:12,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 18:39:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064954557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:12,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-11-23 18:39:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608865855] [2024-11-23 18:39:12,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:12,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 18:39:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:12,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 18:39:12,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:39:12,743 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:12,814 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2024-11-23 18:39:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:39:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-23 18:39:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:12,816 INFO L225 Difference]: With dead ends: 99 [2024-11-23 18:39:12,816 INFO L226 Difference]: Without dead ends: 99 [2024-11-23 18:39:12,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:39:12,817 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:12,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 168 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:39:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-23 18:39:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2024-11-23 18:39:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-11-23 18:39:12,826 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 37 [2024-11-23 18:39:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:12,826 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-11-23 18:39:12,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-11-23 18:39:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-23 18:39:12,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:12,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:12,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 18:39:13,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-23 18:39:13,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:13,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:13,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1764548337, now seen corresponding path program 1 times [2024-11-23 18:39:13,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:13,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318045166] [2024-11-23 18:39:13,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 18:39:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318045166] [2024-11-23 18:39:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318045166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886772527] [2024-11-23 18:39:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:13,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:13,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:13,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:13,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 18:39:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:13,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 18:39:13,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 18:39:13,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 18:39:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886772527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:13,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-23 18:39:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161304231] [2024-11-23 18:39:13,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 18:39:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:13,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 18:39:13,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:39:13,586 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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-11-23 18:39:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:13,677 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-11-23 18:39:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:39:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 38 [2024-11-23 18:39:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:13,679 INFO L225 Difference]: With dead ends: 94 [2024-11-23 18:39:13,679 INFO L226 Difference]: Without dead ends: 94 [2024-11-23 18:39:13,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-23 18:39:13,680 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 173 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:13,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 243 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:39:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-23 18:39:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2024-11-23 18:39:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.36) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-11-23 18:39:13,685 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 38 [2024-11-23 18:39:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:13,685 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-11-23 18:39:13,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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-11-23 18:39:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-11-23 18:39:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-23 18:39:13,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:13,686 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:13,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-23 18:39:13,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-23 18:39:13,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:13,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1569213965, now seen corresponding path program 2 times [2024-11-23 18:39:13,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:13,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700675269] [2024-11-23 18:39:13,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:39:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:13,923 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:39:13,923 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:39:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:39:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700675269] [2024-11-23 18:39:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700675269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:14,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 18:39:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105074587] [2024-11-23 18:39:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:14,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 18:39:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:14,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 18:39:14,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-23 18:39:14,257 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:14,513 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-11-23 18:39:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 18:39:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-23 18:39:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:14,514 INFO L225 Difference]: With dead ends: 86 [2024-11-23 18:39:14,514 INFO L226 Difference]: Without dead ends: 86 [2024-11-23 18:39:14,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-23 18:39:14,515 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:14,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 279 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:39:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-23 18:39:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-23 18:39:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 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-11-23 18:39:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-11-23 18:39:14,520 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 42 [2024-11-23 18:39:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:14,520 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-23 18:39:14,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-11-23 18:39:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-23 18:39:14,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:14,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:14,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-23 18:39:14,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:14,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:14,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2029217178, now seen corresponding path program 1 times [2024-11-23 18:39:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:14,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174029563] [2024-11-23 18:39:14,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-23 18:39:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:14,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174029563] [2024-11-23 18:39:14,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174029563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:14,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:14,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 18:39:14,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128563317] [2024-11-23 18:39:14,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:14,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 18:39:14,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:14,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 18:39:14,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:39:14,701 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:14,774 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-11-23 18:39:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:39:14,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-23 18:39:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:14,775 INFO L225 Difference]: With dead ends: 82 [2024-11-23 18:39:14,775 INFO L226 Difference]: Without dead ends: 82 [2024-11-23 18:39:14,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:39:14,776 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:14,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:39:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-23 18:39:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-23 18:39:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 81 states have internal predecessors, (90), 0 states have call successors, (0), 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-11-23 18:39:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-23 18:39:14,782 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 45 [2024-11-23 18:39:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-23 18:39:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-23 18:39:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-23 18:39:14,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:14,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:14,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 18:39:14,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:14,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2029217247, now seen corresponding path program 1 times [2024-11-23 18:39:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537499665] [2024-11-23 18:39:14,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 18:39:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537499665] [2024-11-23 18:39:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537499665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096049770] [2024-11-23 18:39:16,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:16,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:16,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 18:39:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:16,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-23 18:39:16,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:16,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:39:16,801 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-11-23 18:39:16,912 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 19 treesize of output 1 [2024-11-23 18:39:17,282 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 18:39:17,282 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 42 treesize of output 41 [2024-11-23 18:39:17,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:39:17,453 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 37 treesize of output 19 [2024-11-23 18:39:17,559 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 31 treesize of output 13 [2024-11-23 18:39:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 18:39:17,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:21,968 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-23 18:39:21,969 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 21 treesize of output 20 [2024-11-23 18:39:21,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_971) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-23 18:39:22,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-23 18:39:22,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2024-11-23 18:39:22,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2024-11-23 18:39:22,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-23 18:39:22,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:22,267 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 22 treesize of output 23 [2024-11-23 18:39:22,275 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 36 treesize of output 24 [2024-11-23 18:39:22,283 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 7 treesize of output 3 [2024-11-23 18:39:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2024-11-23 18:39:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096049770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:22,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 46 [2024-11-23 18:39:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270134101] [2024-11-23 18:39:22,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:22,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-23 18:39:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:22,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-23 18:39:22,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1586, Unknown=27, NotChecked=420, Total=2162 [2024-11-23 18:39:22,420 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 47 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 47 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:24,421 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-23 18:39:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 18:39:24,422 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 47 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-23 18:39:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:24,423 INFO L225 Difference]: With dead ends: 88 [2024-11-23 18:39:24,423 INFO L226 Difference]: Without dead ends: 88 [2024-11-23 18:39:24,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=257, Invalid=2816, Unknown=27, NotChecked=560, Total=3660 [2024-11-23 18:39:24,425 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 94 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:24,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1116 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1124 Invalid, 0 Unknown, 301 Unchecked, 1.1s Time] [2024-11-23 18:39:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-23 18:39:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-23 18:39:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 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-11-23 18:39:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2024-11-23 18:39:24,430 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 45 [2024-11-23 18:39:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:24,430 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2024-11-23 18:39:24,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 47 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-23 18:39:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-23 18:39:24,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:24,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:24,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-23 18:39:24,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:24,633 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:24,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2029217248, now seen corresponding path program 1 times [2024-11-23 18:39:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695030478] [2024-11-23 18:39:24,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 18:39:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695030478] [2024-11-23 18:39:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695030478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183460831] [2024-11-23 18:39:26,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:26,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:27,002 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:27,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 18:39:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:27,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-23 18:39:27,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:27,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:39:27,530 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-11-23 18:39:27,724 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 19 treesize of output 1 [2024-11-23 18:39:27,732 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 19 treesize of output 1 [2024-11-23 18:39:28,252 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 18:39:28,252 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 70 treesize of output 65 [2024-11-23 18:39:28,259 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 49 treesize of output 30 [2024-11-23 18:39:28,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:39:28,508 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 45 treesize of output 27 [2024-11-23 18:39:28,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:39:28,516 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 44 treesize of output 26 [2024-11-23 18:39:28,674 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 39 treesize of output 21 [2024-11-23 18:39:28,679 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 32 treesize of output 14 [2024-11-23 18:39:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 18:39:28,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:29,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1084 (Array Int Int))) (or (not (= v_ArrVal_1084 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1084 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1084 (Array Int Int))) (or (not (= v_ArrVal_1084 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1084 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1082 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1082)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2024-11-23 18:39:29,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:29,339 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 46 treesize of output 50 [2024-11-23 18:39:29,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1081) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1080 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))))) is different from false [2024-11-23 18:39:29,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))) (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1081) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-23 18:39:29,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_ArrVal_1080 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2024-11-23 18:39:29,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)) (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))))) is different from false [2024-11-23 18:39:29,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_ArrVal_1080 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 1)))))) is different from false [2024-11-23 18:39:29,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-11-23 18:39:29,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:29,860 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 22 treesize of output 23 [2024-11-23 18:39:29,863 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 40 treesize of output 28 [2024-11-23 18:39:29,878 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:39:29,878 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2024-11-23 18:39:29,886 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:39:29,886 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-23 18:39:30,140 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 18:39:30,140 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 13 treesize of output 12 [2024-11-23 18:39:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2024-11-23 18:39:30,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183460831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:30,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:30,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 53 [2024-11-23 18:39:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885717892] [2024-11-23 18:39:30,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:30,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-23 18:39:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:30,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-23 18:39:30,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=28, NotChecked=672, Total=2862 [2024-11-23 18:39:30,248 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 54 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:32,719 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-23 18:39:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 18:39:32,719 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-23 18:39:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:32,720 INFO L225 Difference]: With dead ends: 87 [2024-11-23 18:39:32,720 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 18:39:32,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=295, Invalid=3127, Unknown=28, NotChecked=840, Total=4290 [2024-11-23 18:39:32,722 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:32,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 992 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 839 Invalid, 0 Unknown, 404 Unchecked, 0.9s Time] [2024-11-23 18:39:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 18:39:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-11-23 18:39:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 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-11-23 18:39:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-11-23 18:39:32,727 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 45 [2024-11-23 18:39:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:32,727 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-11-23 18:39:32,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-11-23 18:39:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-23 18:39:32,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:32,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:32,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-23 18:39:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:32,932 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2068206098, now seen corresponding path program 1 times [2024-11-23 18:39:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792631768] [2024-11-23 18:39:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-23 18:39:33,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:33,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792631768] [2024-11-23 18:39:33,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792631768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 18:39:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638170899] [2024-11-23 18:39:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:33,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:39:33,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:33,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:39:33,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:39:33,100 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:33,165 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-11-23 18:39:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:39:33,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-23 18:39:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:33,166 INFO L225 Difference]: With dead ends: 82 [2024-11-23 18:39:33,166 INFO L226 Difference]: Without dead ends: 82 [2024-11-23 18:39:33,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:39:33,167 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:33,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:39:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-23 18:39:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-23 18:39:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-23 18:39:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-23 18:39:33,171 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 48 [2024-11-23 18:39:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:33,171 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-23 18:39:33,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-23 18:39:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-23 18:39:33,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:33,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:33,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-23 18:39:33,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:33,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 561579808, now seen corresponding path program 1 times [2024-11-23 18:39:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:33,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057731936] [2024-11-23 18:39:33,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:39:35,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057731936] [2024-11-23 18:39:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057731936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039782687] [2024-11-23 18:39:35,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:35,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:35,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 18:39:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:35,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-23 18:39:36,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:36,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:39:36,329 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-11-23 18:39:36,542 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 19 treesize of output 1 [2024-11-23 18:39:36,551 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 19 treesize of output 1 [2024-11-23 18:39:37,307 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 18:39:37,308 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 80 treesize of output 73 [2024-11-23 18:39:37,315 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 29 treesize of output 19 [2024-11-23 18:39:37,321 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 49 treesize of output 30 [2024-11-23 18:39:37,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:39:37,633 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 45 treesize of output 27 [2024-11-23 18:39:37,641 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 28 treesize of output 23 [2024-11-23 18:39:37,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:39:37,649 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 44 treesize of output 26 [2024-11-23 18:39:37,985 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 39 treesize of output 21 [2024-11-23 18:39:37,992 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 32 treesize of output 14 [2024-11-23 18:39:38,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:39:38,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:38,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-23 18:39:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 18:39:38,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:39,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:39,661 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 31 treesize of output 32 [2024-11-23 18:39:39,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:39,681 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 65 treesize of output 68 [2024-11-23 18:39:39,692 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 22 treesize of output 20 [2024-11-23 18:39:39,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (forall ((v_ArrVal_1243 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (< .cse0 0)))) (or .cse2 (forall ((v_ArrVal_1244 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|)))) (or .cse2 (forall ((v_ArrVal_1244 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (or .cse2 (< |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (or (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) .cse2)))) is different from false [2024-11-23 18:39:39,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (forall ((v_ArrVal_1243 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse0 0) (< .cse0 (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))))) (or (< |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1) .cse2) (or (forall ((v_ArrVal_1244 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|))) .cse2) (or (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) .cse2) (or (forall ((v_ArrVal_1244 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) .cse2)))) is different from false [2024-11-23 18:39:40,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3)) (.cse0 (forall ((v_ArrVal_1243 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1243) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) 0)))) (and (or .cse0 (< .cse1 1)) (or (forall ((v_ArrVal_1244 (Array Int Int))) (= .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1244) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) .cse0) (forall ((v_ArrVal_1243 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1243) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (or (< .cse4 (+ .cse1 1)) (< .cse4 0)))) (or .cse0 (forall ((v_ArrVal_1244 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1244) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))))))))) is different from false [2024-11-23 18:39:41,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:41,041 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 22 treesize of output 23 [2024-11-23 18:39:41,046 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 36 treesize of output 24 [2024-11-23 18:39:41,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:41,063 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 22 treesize of output 23 [2024-11-23 18:39:41,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:41,074 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 22 treesize of output 23 [2024-11-23 18:39:41,083 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 36 treesize of output 24 [2024-11-23 18:39:41,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:39:41,094 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 18 treesize of output 12 [2024-11-23 18:39:41,100 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 7 treesize of output 3 [2024-11-23 18:39:41,115 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:39:41,115 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-23 18:39:41,120 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 18:39:41,559 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 18:39:41,559 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 13 treesize of output 12 [2024-11-23 18:39:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-23 18:39:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039782687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:41,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 76 [2024-11-23 18:39:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182897546] [2024-11-23 18:39:41,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-23 18:39:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:41,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-23 18:39:41,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=4994, Unknown=24, NotChecked=432, Total=5700 [2024-11-23 18:39:41,761 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 76 states, 76 states have (on average 1.8289473684210527) internal successors, (139), 76 states have internal predecessors, (139), 0 states have call successors, (0), 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-11-23 18:39:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:46,541 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-23 18:39:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-23 18:39:46,542 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.8289473684210527) internal successors, (139), 76 states have internal predecessors, (139), 0 states have call successors, (0), 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 51 [2024-11-23 18:39:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:46,543 INFO L225 Difference]: With dead ends: 85 [2024-11-23 18:39:46,543 INFO L226 Difference]: Without dead ends: 85 [2024-11-23 18:39:46,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2330 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=579, Invalid=8523, Unknown=30, NotChecked=570, Total=9702 [2024-11-23 18:39:46,548 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 178 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:46,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1465 Invalid, 2313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2046 Invalid, 0 Unknown, 251 Unchecked, 2.2s Time] [2024-11-23 18:39:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-23 18:39:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-11-23 18:39:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-23 18:39:46,553 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 51 [2024-11-23 18:39:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:46,553 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-23 18:39:46,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.8289473684210527) internal successors, (139), 76 states have internal predecessors, (139), 0 states have call successors, (0), 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-11-23 18:39:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-23 18:39:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-23 18:39:46,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:46,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:46,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-23 18:39:46,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-23 18:39:46,759 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:46,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash 590926333, now seen corresponding path program 1 times [2024-11-23 18:39:46,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:46,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055010154] [2024-11-23 18:39:46,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:46,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:39:47,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055010154] [2024-11-23 18:39:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055010154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348317636] [2024-11-23 18:39:47,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:47,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:47,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:47,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 18:39:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:47,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-23 18:39:47,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:47,821 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 15 treesize of output 11 [2024-11-23 18:39:48,071 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 24 treesize of output 12 [2024-11-23 18:39:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:39:48,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:48,339 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 36 treesize of output 32 [2024-11-23 18:39:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:39:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348317636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:48,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:48,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 26 [2024-11-23 18:39:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242087752] [2024-11-23 18:39:48,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:48,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-23 18:39:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:48,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-23 18:39:48,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-23 18:39:48,399 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:49,056 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-23 18:39:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 18:39:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-23 18:39:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:49,058 INFO L225 Difference]: With dead ends: 85 [2024-11-23 18:39:49,058 INFO L226 Difference]: Without dead ends: 85 [2024-11-23 18:39:49,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2024-11-23 18:39:49,059 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 136 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:49,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 637 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 18:39:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-23 18:39:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-23 18:39:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 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-11-23 18:39:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-11-23 18:39:49,066 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 58 [2024-11-23 18:39:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:49,067 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-11-23 18:39:49,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-11-23 18:39:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-23 18:39:49,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:49,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:49,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-23 18:39:49,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-23 18:39:49,273 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:49,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1138936823, now seen corresponding path program 1 times [2024-11-23 18:39:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171830228] [2024-11-23 18:39:49,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-23 18:39:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171830228] [2024-11-23 18:39:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171830228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:49,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 18:39:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127756063] [2024-11-23 18:39:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 18:39:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 18:39:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:39:49,494 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:49,783 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-23 18:39:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 18:39:49,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-23 18:39:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:49,784 INFO L225 Difference]: With dead ends: 83 [2024-11-23 18:39:49,784 INFO L226 Difference]: Without dead ends: 83 [2024-11-23 18:39:49,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-23 18:39:49,785 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:49,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:39:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-23 18:39:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-23 18:39:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.155844155844156) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 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-11-23 18:39:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-23 18:39:49,789 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 59 [2024-11-23 18:39:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:49,790 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-23 18:39:49,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-23 18:39:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-23 18:39:49,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:49,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:49,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-23 18:39:49,794 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:49,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:49,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1138936824, now seen corresponding path program 1 times [2024-11-23 18:39:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:49,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798394700] [2024-11-23 18:39:49,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:49,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-23 18:39:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:50,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798394700] [2024-11-23 18:39:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798394700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:50,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:50,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 18:39:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694058192] [2024-11-23 18:39:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:50,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 18:39:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:50,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 18:39:50,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-23 18:39:50,232 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:50,569 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-23 18:39:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 18:39:50,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-23 18:39:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:50,570 INFO L225 Difference]: With dead ends: 85 [2024-11-23 18:39:50,570 INFO L226 Difference]: Without dead ends: 85 [2024-11-23 18:39:50,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-23 18:39:50,571 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:50,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 253 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 18:39:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-23 18:39:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-23 18:39:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.139240506329114) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 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-11-23 18:39:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-23 18:39:50,579 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 59 [2024-11-23 18:39:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:50,579 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-23 18:39:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-23 18:39:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-23 18:39:50,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:50,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:50,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-23 18:39:50,584 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:50,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash 947305589, now seen corresponding path program 1 times [2024-11-23 18:39:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809170740] [2024-11-23 18:39:50,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-23 18:39:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809170740] [2024-11-23 18:39:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809170740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:50,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:50,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 18:39:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069490555] [2024-11-23 18:39:50,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:50,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 18:39:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:50,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 18:39:50,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:39:50,784 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:51,004 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-23 18:39:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 18:39:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-23 18:39:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:51,005 INFO L225 Difference]: With dead ends: 87 [2024-11-23 18:39:51,006 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 18:39:51,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-23 18:39:51,006 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:51,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 266 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:39:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 18:39:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-23 18:39:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 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-11-23 18:39:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-23 18:39:51,013 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 60 [2024-11-23 18:39:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-23 18:39:51,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-23 18:39:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-23 18:39:51,016 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:51,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:51,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-23 18:39:51,016 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1449982805, now seen corresponding path program 2 times [2024-11-23 18:39:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:51,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879069042] [2024-11-23 18:39:51,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:39:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:51,055 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:39:51,055 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:39:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-23 18:39:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879069042] [2024-11-23 18:39:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879069042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436190928] [2024-11-23 18:39:51,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:39:51,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:51,201 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:51,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 18:39:51,457 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:39:51,457 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:39:51,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 18:39:51,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-23 18:39:51,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-23 18:39:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436190928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:51,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:51,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-23 18:39:51,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105701670] [2024-11-23 18:39:51,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:51,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 18:39:51,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:51,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 18:39:51,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:39:51,690 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:51,761 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-23 18:39:51,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:39:51,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-23 18:39:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:51,763 INFO L225 Difference]: With dead ends: 74 [2024-11-23 18:39:51,763 INFO L226 Difference]: Without dead ends: 74 [2024-11-23 18:39:51,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-23 18:39:51,764 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:51,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 128 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:39:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-23 18:39:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-23 18:39:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-23 18:39:51,768 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 61 [2024-11-23 18:39:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:51,768 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-23 18:39:51,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-23 18:39:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-23 18:39:51,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:51,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:51,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-23 18:39:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-23 18:39:51,970 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -174648022, now seen corresponding path program 1 times [2024-11-23 18:39:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444623770] [2024-11-23 18:39:51,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-23 18:39:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444623770] [2024-11-23 18:39:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444623770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:39:52,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:39:52,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 18:39:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011559697] [2024-11-23 18:39:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:39:52,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 18:39:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:52,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 18:39:52,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:39:52,229 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:52,481 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-23 18:39:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 18:39:52,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-23 18:39:52,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:52,483 INFO L225 Difference]: With dead ends: 75 [2024-11-23 18:39:52,483 INFO L226 Difference]: Without dead ends: 75 [2024-11-23 18:39:52,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-23 18:39:52,484 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:52,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 222 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:39:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-23 18:39:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-23 18:39:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-23 18:39:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-23 18:39:52,491 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2024-11-23 18:39:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:52,491 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-23 18:39:52,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:39:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-23 18:39:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-23 18:39:52,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:52,492 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:52,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-23 18:39:52,492 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:52,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1733666497, now seen corresponding path program 1 times [2024-11-23 18:39:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497946167] [2024-11-23 18:39:52,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-23 18:39:54,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:39:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497946167] [2024-11-23 18:39:54,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497946167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:39:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911476956] [2024-11-23 18:39:54,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:54,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:54,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:54,158 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:54,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-23 18:39:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:39:54,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-23 18:39:54,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:54,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:39:54,496 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-11-23 18:39:54,641 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-11-23 18:39:55,024 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 18:39:55,025 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-11-23 18:39:55,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:39:55,172 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 33 treesize of output 17 [2024-11-23 18:39:55,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:55,511 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 27 treesize of output 21 [2024-11-23 18:39:55,738 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-23 18:39:55,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-23 18:39:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-23 18:39:55,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:39:56,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:56,531 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 45 treesize of output 49 [2024-11-23 18:39:56,621 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1776 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1776) 4)))) (forall ((v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_4) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_3 v_prenex_5) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_3)))) is different from false [2024-11-23 18:39:56,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_4) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_3 v_prenex_5) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_3))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1776 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1774) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1776) 4)))))) is different from false [2024-11-23 18:39:57,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1776 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1774) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1776) 4)))) (forall ((v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| v_prenex_3) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_4) |c_ULTIMATE.start_sll_create_#res#1.base|) v_prenex_3 v_prenex_5) 4) |c_ULTIMATE.start_sll_create_#res#1.base|)))))) is different from false [2024-11-23 18:39:57,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_5) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_prenex_3))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1776 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1774) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1776) 4) .cse0))))) is different from false [2024-11-23 18:39:57,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:57,445 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 23 treesize of output 24 [2024-11-23 18:39:57,450 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 38 treesize of output 34 [2024-11-23 18:39:57,458 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 22 treesize of output 20 [2024-11-23 18:39:57,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:39:57,476 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 32 treesize of output 34 [2024-11-23 18:39:57,529 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 18:39:57,529 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-23 18:39:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 5 not checked. [2024-11-23 18:39:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911476956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:57,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:39:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 51 [2024-11-23 18:39:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902245423] [2024-11-23 18:39:57,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:57,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-23 18:39:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:39:57,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-23 18:39:57,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2069, Unknown=25, NotChecked=380, Total=2652 [2024-11-23 18:39:57,663 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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-11-23 18:39:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:59,609 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-23 18:39:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-23 18:39:59,610 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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 65 [2024-11-23 18:39:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:59,611 INFO L225 Difference]: With dead ends: 85 [2024-11-23 18:39:59,611 INFO L226 Difference]: Without dead ends: 85 [2024-11-23 18:39:59,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=305, Invalid=3468, Unknown=25, NotChecked=492, Total=4290 [2024-11-23 18:39:59,613 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:59,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 737 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1430 Invalid, 0 Unknown, 277 Unchecked, 1.2s Time] [2024-11-23 18:39:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-23 18:39:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-11-23 18:39:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-23 18:39:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-23 18:39:59,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2024-11-23 18:39:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:59,616 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-23 18:39:59,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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-11-23 18:39:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-23 18:39:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-23 18:39:59,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:59,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:59,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-23 18:39:59,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-23 18:39:59,819 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:39:59,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1733666496, now seen corresponding path program 1 times [2024-11-23 18:39:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:39:59,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757882191] [2024-11-23 18:39:59,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:39:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:39:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:40:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:40:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:40:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757882191] [2024-11-23 18:40:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757882191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:40:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944232022] [2024-11-23 18:40:01,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:40:01,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:40:01,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:40:01,826 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:40:01,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-23 18:40:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:40:02,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-23 18:40:02,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:40:02,175 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-11-23 18:40:02,348 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:40:02,349 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-11-23 18:40:02,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-23 18:40:02,422 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-11-23 18:40:02,433 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-11-23 18:40:02,757 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 18:40:02,757 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-11-23 18:40:02,769 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-11-23 18:40:02,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:40:02,930 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 33 treesize of output 17 [2024-11-23 18:40:02,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:40:02,946 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 23 treesize of output 11 [2024-11-23 18:40:03,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:03,369 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 17 treesize of output 15 [2024-11-23 18:40:03,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:03,382 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 27 treesize of output 21 [2024-11-23 18:40:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:40:03,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:40:04,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1890 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1890 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1890)))) (forall ((v_ArrVal_1890 (Array Int Int))) (or (forall ((v_ArrVal_1892 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1892)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1890 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1890)))))) is different from false [2024-11-23 18:40:04,423 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))) is different from false [2024-11-23 18:40:04,466 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4)))))) is different from false [2024-11-23 18:40:04,491 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1888) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4) 5)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-11-23 18:40:04,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1888) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4) 5)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-11-23 18:40:04,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1888) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-11-23 18:40:04,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1888) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-11-23 18:40:04,693 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1888) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-11-23 18:40:04,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:04,714 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 25 treesize of output 26 [2024-11-23 18:40:04,717 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 42 treesize of output 38 [2024-11-23 18:40:04,724 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 26 treesize of output 24 [2024-11-23 18:40:04,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:04,741 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 36 treesize of output 38 [2024-11-23 18:40:04,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:04,792 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-11-23 18:40:04,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:04,805 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-23 18:40:04,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:40:04,813 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 33 treesize of output 29 [2024-11-23 18:40:04,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:40:04,820 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 28 treesize of output 24 [2024-11-23 18:40:04,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:40:04,828 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 21 treesize of output 17 [2024-11-23 18:40:04,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:40:04,836 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 16 treesize of output 12 [2024-11-23 18:40:05,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:05,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-23 18:40:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2024-11-23 18:40:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944232022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:40:05,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:40:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 57 [2024-11-23 18:40:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559283899] [2024-11-23 18:40:05,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:40:05,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-23 18:40:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:40:05,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-23 18:40:05,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2284, Unknown=8, NotChecked=824, Total=3306 [2024-11-23 18:40:05,610 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 58 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 58 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:40:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:40:07,839 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-23 18:40:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-23 18:40:07,840 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 58 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-23 18:40:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:40:07,841 INFO L225 Difference]: With dead ends: 87 [2024-11-23 18:40:07,841 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 18:40:07,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=315, Invalid=3615, Unknown=8, NotChecked=1032, Total=4970 [2024-11-23 18:40:07,844 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:40:07,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 747 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1258 Invalid, 0 Unknown, 562 Unchecked, 1.1s Time] [2024-11-23 18:40:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 18:40:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-23 18:40:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 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-11-23 18:40:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-23 18:40:07,848 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2024-11-23 18:40:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:40:07,849 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-23 18:40:07,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 58 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:40:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-23 18:40:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-23 18:40:07,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:40:07,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:40:07,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-23 18:40:08,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:40:08,051 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:40:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:40:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2090915885, now seen corresponding path program 1 times [2024-11-23 18:40:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:40:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553548022] [2024-11-23 18:40:08,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:40:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:40:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:40:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:40:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:40:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553548022] [2024-11-23 18:40:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553548022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:40:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954247102] [2024-11-23 18:40:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:40:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:40:09,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:40:09,814 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:40:09,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-23 18:40:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:40:10,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-23 18:40:10,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:40:10,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:40:10,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-11-23 18:40:10,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-23 18:40:11,004 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 18:40:11,005 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 33 treesize of output 32 [2024-11-23 18:40:11,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:40:11,115 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 32 treesize of output 16 [2024-11-23 18:40:11,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:11,340 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 26 treesize of output 20 [2024-11-23 18:40:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:40:11,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:40:12,462 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_75| Int) (v_ArrVal_2002 Int) (v_ArrVal_2000 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2000) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_75| v_ArrVal_2002) 4) 0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_75|))) is different from false [2024-11-23 18:40:12,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:12,771 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 24 treesize of output 25 [2024-11-23 18:40:12,776 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 41 treesize of output 37 [2024-11-23 18:40:12,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:12,792 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 48 treesize of output 50 [2024-11-23 18:40:12,799 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 48 treesize of output 46 [2024-11-23 18:40:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:40:13,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954247102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:40:13,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:40:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 57 [2024-11-23 18:40:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980055839] [2024-11-23 18:40:13,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:40:13,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-23 18:40:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:40:13,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-23 18:40:13,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2815, Unknown=57, NotChecked=108, Total=3192 [2024-11-23 18:40:13,052 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 57 states, 57 states have (on average 2.56140350877193) internal successors, (146), 57 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:40:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:40:14,741 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-23 18:40:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-23 18:40:14,741 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.56140350877193) internal successors, (146), 57 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-23 18:40:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:40:14,742 INFO L225 Difference]: With dead ends: 89 [2024-11-23 18:40:14,742 INFO L226 Difference]: Without dead ends: 89 [2024-11-23 18:40:14,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=370, Invalid=4547, Unknown=57, NotChecked=138, Total=5112 [2024-11-23 18:40:14,744 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 73 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 18:40:14,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 792 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1100 Invalid, 0 Unknown, 65 Unchecked, 0.9s Time] [2024-11-23 18:40:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-23 18:40:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-23 18:40:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-23 18:40:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-23 18:40:14,750 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2024-11-23 18:40:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:40:14,750 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-23 18:40:14,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.56140350877193) internal successors, (146), 57 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:40:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-23 18:40:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-23 18:40:14,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:40:14,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:40:14,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-23 18:40:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:40:14,952 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:40:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:40:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash -676781342, now seen corresponding path program 1 times [2024-11-23 18:40:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:40:14,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543481767] [2024-11-23 18:40:14,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:40:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:40:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:40:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:40:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:40:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543481767] [2024-11-23 18:40:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543481767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:40:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563673603] [2024-11-23 18:40:16,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:40:16,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:40:16,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:40:16,608 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:40:16,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-23 18:40:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:40:16,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-23 18:40:16,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:40:17,088 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:40:17,088 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-11-23 18:40:17,147 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-11-23 18:40:17,421 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 18:40:17,421 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-11-23 18:40:17,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:40:17,519 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 33 treesize of output 17 [2024-11-23 18:40:17,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:17,726 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 27 treesize of output 21 [2024-11-23 18:40:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:40:17,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:40:18,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2110) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-11-23 18:40:18,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2110) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-11-23 18:40:19,170 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2110) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-11-23 18:40:19,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:19,179 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 23 treesize of output 24 [2024-11-23 18:40:19,182 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 38 treesize of output 34 [2024-11-23 18:40:19,193 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 26 treesize of output 24 [2024-11-23 18:40:19,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:19,210 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 36 treesize of output 38 [2024-11-23 18:40:19,495 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 18:40:19,495 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 13 treesize of output 12 [2024-11-23 18:40:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2024-11-23 18:40:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563673603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:40:19,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:40:19,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 48 [2024-11-23 18:40:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794353560] [2024-11-23 18:40:19,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:40:19,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-23 18:40:19,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:40:19,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-23 18:40:19,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1850, Unknown=66, NotChecked=270, Total=2352 [2024-11-23 18:40:19,577 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 49 states, 48 states have (on average 2.8125) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 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-11-23 18:40:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:40:21,315 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-11-23 18:40:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-23 18:40:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.8125) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 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 68 [2024-11-23 18:40:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:40:21,316 INFO L225 Difference]: With dead ends: 88 [2024-11-23 18:40:21,316 INFO L226 Difference]: Without dead ends: 88 [2024-11-23 18:40:21,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=281, Invalid=3202, Unknown=69, NotChecked=354, Total=3906 [2024-11-23 18:40:21,318 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 18:40:21,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 723 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1118 Invalid, 0 Unknown, 207 Unchecked, 0.9s Time] [2024-11-23 18:40:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-23 18:40:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-23 18:40:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 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-11-23 18:40:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-23 18:40:21,323 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2024-11-23 18:40:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:40:21,323 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-23 18:40:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.8125) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 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-11-23 18:40:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-23 18:40:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-23 18:40:21,324 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:40:21,324 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:40:21,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-23 18:40:21,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-23 18:40:21,525 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:40:21,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:40:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1416310649, now seen corresponding path program 2 times [2024-11-23 18:40:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:40:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786420196] [2024-11-23 18:40:21,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:40:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:40:21,586 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:40:21,586 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:40:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 18:40:25,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:40:25,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786420196] [2024-11-23 18:40:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786420196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:40:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224488096] [2024-11-23 18:40:25,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:40:25,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:40:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:40:25,450 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:40:25,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-23 18:40:25,968 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:40:25,969 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:40:25,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-23 18:40:25,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:40:26,208 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-11-23 18:40:26,229 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-11-23 18:40:26,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:40:26,363 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-11-23 18:40:26,484 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 16 treesize of output 11 [2024-11-23 18:40:26,516 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 16 treesize of output 11 [2024-11-23 18:40:26,543 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 16 treesize of output 11 [2024-11-23 18:40:26,553 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 16 treesize of output 11 [2024-11-23 18:40:26,758 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 27 treesize of output 15 [2024-11-23 18:40:26,775 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 27 treesize of output 15 [2024-11-23 18:40:27,780 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2024-11-23 18:40:27,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2024-11-23 18:40:27,920 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-11-23 18:40:27,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2024-11-23 18:40:29,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:40:29,349 INFO L349 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2024-11-23 18:40:29,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 142 [2024-11-23 18:40:29,425 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-23 18:40:29,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 115 [2024-11-23 18:40:30,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:40:30,047 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 13 treesize of output 11 [2024-11-23 18:40:30,079 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 7 treesize of output 3 [2024-11-23 18:40:30,132 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 7 treesize of output 3 [2024-11-23 18:40:30,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:40:30,255 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-23 18:40:34,858 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-11-23 18:40:35,065 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-23 18:40:35,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 43 [2024-11-23 18:40:35,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:35,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-23 18:40:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:40:35,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:40:35,308 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 10 treesize of output 8 [2024-11-23 18:40:41,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2229) .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select .cse5 .cse4) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))))))) is different from false [2024-11-23 18:40:41,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2229) .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5))))))) is different from false [2024-11-23 18:40:41,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select .cse2 .cse0) 4) 0))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2229) .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)))))))) is different from false [2024-11-23 18:40:41,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2229) .cse0) 4) 0) (not (= v_ArrVal_2229 (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))))))) is different from false [2024-11-23 18:40:41,932 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse1 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select .cse1 .cse2) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8)) (.cse7 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= v_ArrVal_2229 (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (= (select (select (store .cse6 .cse4 v_ArrVal_2229) .cse7) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7))))))))) is different from false [2024-11-23 18:40:42,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse3 (select .cse10 4)) (.cse4 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse4 4)) (.cse6 (select .cse5 .cse3))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse1 (select (select (store .cse5 .cse3 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_node_create_#res#1.base|) 4)) (.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse1) (= (select (select (store .cse2 .cse3 v_ArrVal_2229) .cse1) 4) 0) (not (= (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse7 (store .cse5 .cse3 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (= (select (select .cse7 .cse8) 4) 0) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8)))))))))) is different from false [2024-11-23 18:40:42,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse1 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse0) (= (select (select .cse1 .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8)) (.cse6 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse6) (not (= (store (select .cse7 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)) (= (select (select (store .cse7 .cse4 v_ArrVal_2229) .cse6) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|))))))))) is different from false [2024-11-23 18:40:42,188 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-23 18:40:42,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 111 treesize of output 118 [2024-11-23 18:40:42,268 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-23 18:40:42,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 213 treesize of output 180 [2024-11-23 18:40:43,148 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-23 18:40:43,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 211 treesize of output 158 [2024-11-23 18:40:43,159 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 18 treesize of output 16 [2024-11-23 18:41:19,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:19,531 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 282 treesize of output 223 [2024-11-23 18:41:19,692 INFO L349 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2024-11-23 18:41:19,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 897 treesize of output 831 [2024-11-23 18:41:19,895 INFO L349 Elim1Store]: treesize reduction 44, result has 63.3 percent of original size [2024-11-23 18:41:19,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 569 treesize of output 605 [2024-11-23 18:41:19,931 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 486 treesize of output 454 [2024-11-23 18:41:20,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:20,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 433 [2024-11-23 18:41:20,127 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-23 18:41:20,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 339 treesize of output 348 [2024-11-23 18:41:20,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:20,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 353 [2024-11-23 18:41:20,296 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 450 treesize of output 416 [2024-11-23 18:41:21,103 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 8 treesize of output 4 [2024-11-23 18:41:21,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:21,128 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 60 treesize of output 62 [2024-11-23 18:41:21,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:21,264 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 41 treesize of output 43 [2024-11-23 18:41:21,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:21,303 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 21 treesize of output 23 [2024-11-23 18:41:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 9 not checked. [2024-11-23 18:41:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224488096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:41:21,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:41:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 73 [2024-11-23 18:41:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528909955] [2024-11-23 18:41:21,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:41:21,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-23 18:41:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:41:21,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-23 18:41:21,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4061, Unknown=27, NotChecked=938, Total=5256 [2024-11-23 18:41:21,360 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 73 states have internal predecessors, (166), 0 states have call successors, (0), 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-11-23 18:41:23,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 18:41:27,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 18:41:42,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 18:41:59,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 18:42:04,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 18:42:05,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 18:42:10,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 18:42:29,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-23 18:42:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:42:30,744 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2024-11-23 18:42:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-23 18:42:30,746 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 73 states have internal predecessors, (166), 0 states have call successors, (0), 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 71 [2024-11-23 18:42:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:42:30,748 INFO L225 Difference]: With dead ends: 142 [2024-11-23 18:42:30,748 INFO L226 Difference]: Without dead ends: 142 [2024-11-23 18:42:30,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=373, Invalid=6429, Unknown=32, NotChecked=1176, Total=8010 [2024-11-23 18:42:30,758 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2024-11-23 18:42:30,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1481 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1889 Invalid, 1 Unknown, 524 Unchecked, 32.8s Time] [2024-11-23 18:42:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-23 18:42:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-23 18:42:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:42:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2024-11-23 18:42:30,780 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2024-11-23 18:42:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:42:30,781 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2024-11-23 18:42:30,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 73 states have internal predecessors, (166), 0 states have call successors, (0), 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-11-23 18:42:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2024-11-23 18:42:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-23 18:42:30,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:42:30,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:42:30,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-23 18:42:30,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:42:30,988 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:42:30,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:42:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -955954715, now seen corresponding path program 2 times [2024-11-23 18:42:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:42:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624352967] [2024-11-23 18:42:30,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:42:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:42:31,057 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:42:31,058 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:42:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 18:42:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:42:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624352967] [2024-11-23 18:42:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624352967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:42:33,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245606513] [2024-11-23 18:42:33,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:42:33,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:42:33,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:42:33,554 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:42:33,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-23 18:42:33,958 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:42:33,958 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:42:33,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-23 18:42:33,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:42:34,274 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-23 18:42:34,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-23 18:42:34,383 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 15 treesize of output 1 [2024-11-23 18:42:35,031 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-23 18:42:35,031 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 46 treesize of output 49 [2024-11-23 18:42:35,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:42:35,044 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 29 treesize of output 25 [2024-11-23 18:42:35,446 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-23 18:42:35,446 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 65 treesize of output 53 [2024-11-23 18:42:36,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:42:36,317 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 59 treesize of output 53 [2024-11-23 18:42:36,870 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-23 18:42:36,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 41 [2024-11-23 18:42:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 18:42:37,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:42:38,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-23 18:42:38,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-23 18:42:38,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-23 18:42:38,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-23 18:42:38,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:42:38,678 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 2 case distinctions, treesize of input 39 treesize of output 39 [2024-11-23 18:42:38,723 INFO L349 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2024-11-23 18:42:38,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 63 treesize of output 73 [2024-11-23 18:42:38,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:42:38,740 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 117 treesize of output 107 [2024-11-23 18:42:38,749 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 86 treesize of output 82 [2024-11-23 18:43:15,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base| 0))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse4 (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_node_create_#res#1.offset| 0))) (and (or .cse0 (forall ((v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (or (= |c_ULTIMATE.start_node_create_#res#1.base| v_arrayElimCell_181) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse2 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse2 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse2 (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse4 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse3 v_antiDerIndex_entry0_1)))) (or (forall ((v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (and .cse0 (not .cse4))) (or .cse0 (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse5 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse5 (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse5 (select (store .cse1 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))))))))) is different from false [2024-11-23 18:43:19,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base| 0))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse2 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (or .cse0 (forall ((v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimCell_181) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))))) (or .cse2 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse3 v_antiDerIndex_entry0_1)))) (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse4 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse4 (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store .cse1 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))))) .cse0) (forall ((v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse5 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse5 (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse5 (select .cse3 v_antiDerIndex_entry0_1))))) (or (and (not .cse2) .cse0) (forall ((v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) is different from false [2024-11-23 18:43:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 11 not checked. [2024-11-23 18:43:25,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245606513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:43:25,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:43:25,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 64 [2024-11-23 18:43:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019548542] [2024-11-23 18:43:25,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:43:25,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-23 18:43:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:43:25,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-23 18:43:25,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3224, Unknown=16, NotChecked=714, Total=4160 [2024-11-23 18:43:25,502 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 65 states, 64 states have (on average 2.65625) internal successors, (170), 65 states have internal predecessors, (170), 0 states have call successors, (0), 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-11-23 18:43:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:43:28,772 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2024-11-23 18:43:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 18:43:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.65625) internal successors, (170), 65 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-23 18:43:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:43:28,774 INFO L225 Difference]: With dead ends: 142 [2024-11-23 18:43:28,774 INFO L226 Difference]: Without dead ends: 91 [2024-11-23 18:43:28,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 103 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=282, Invalid=4148, Unknown=16, NotChecked=810, Total=5256 [2024-11-23 18:43:28,777 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:43:28,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1049 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1452 Invalid, 0 Unknown, 474 Unchecked, 2.3s Time] [2024-11-23 18:43:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-23 18:43:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-23 18:43:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 89 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:43:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2024-11-23 18:43:28,784 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 72 [2024-11-23 18:43:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:43:28,785 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2024-11-23 18:43:28,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.65625) internal successors, (170), 65 states have internal predecessors, (170), 0 states have call successors, (0), 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-11-23 18:43:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2024-11-23 18:43:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-23 18:43:28,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:43:28,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:43:28,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-23 18:43:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:43:28,988 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-23 18:43:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:43:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash -690980297, now seen corresponding path program 3 times [2024-11-23 18:43:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:43:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333827701] [2024-11-23 18:43:28,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 18:43:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:43:29,049 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-23 18:43:29,049 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:43:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-23 18:43:29,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:43:29,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333827701] [2024-11-23 18:43:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333827701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:43:29,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879245233] [2024-11-23 18:43:29,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 18:43:29,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:43:29,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:43:29,172 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:43:29,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-23 18:43:29,873 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-23 18:43:29,874 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:43:29,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 18:43:29,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:43:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-23 18:43:29,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:43:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879245233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:43:29,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 18:43:29,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-23 18:43:29,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157767073] [2024-11-23 18:43:29,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:43:29,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:43:29,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:43:29,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:43:29,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:43:29,929 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:43:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:43:29,941 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-11-23 18:43:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 18:43:29,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-23 18:43:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:43:29,942 INFO L225 Difference]: With dead ends: 21 [2024-11-23 18:43:29,943 INFO L226 Difference]: Without dead ends: 0 [2024-11-23 18:43:29,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:43:29,943 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:43:29,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:43:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-23 18:43:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-23 18:43:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:43:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-23 18:43:29,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-11-23 18:43:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:43:29,946 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 18:43:29,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:43:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-23 18:43:29,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-23 18:43:29,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-23 18:43:29,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-23 18:43:29,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-23 18:43:29,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-23 18:43:29,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-23 18:43:29,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-23 18:43:29,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-23 18:43:29,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-23 18:43:29,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-23 18:43:29,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-23 18:43:29,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-23 18:43:29,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2024-11-23 18:43:29,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-23 18:43:29,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-23 18:43:30,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:43:30,183 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:43:30,196 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 18:43:30,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:43:30 BoogieIcfgContainer [2024-11-23 18:43:30,211 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 18:43:30,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 18:43:30,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 18:43:30,217 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 18:43:30,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:55" (3/4) ... [2024-11-23 18:43:30,228 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-23 18:43:30,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-23 18:43:30,268 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-23 18:43:30,268 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-23 18:43:30,269 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-23 18:43:30,434 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 18:43:30,435 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 18:43:30,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 18:43:30,436 INFO L158 Benchmark]: Toolchain (without parser) took 276286.34ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 99.5MB in the beginning and 226.7MB in the end (delta: -127.2MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-23 18:43:30,436 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:43:30,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.12ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 81.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 18:43:30,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.72ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 79.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:43:30,437 INFO L158 Benchmark]: Boogie Preprocessor took 92.51ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 18:43:30,438 INFO L158 Benchmark]: RCFGBuilder took 794.19ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 59.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 18:43:30,438 INFO L158 Benchmark]: TraceAbstraction took 274448.67ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 58.6MB in the beginning and 231.5MB in the end (delta: -172.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:43:30,438 INFO L158 Benchmark]: Witness Printer took 218.65ms. Allocated memory is still 293.6MB. Free memory was 231.5MB in the beginning and 226.7MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:43:30,440 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.12ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 81.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.72ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 79.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 92.51ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 794.19ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 59.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 274448.67ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 58.6MB in the beginning and 231.5MB in the end (delta: -172.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 218.65ms. Allocated memory is still 293.6MB. Free memory was 231.5MB in the beginning and 226.7MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 274.3s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 97.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1823 SdHoareTripleChecker+Valid, 48.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1823 mSDsluCounter, 15403 SdHoareTripleChecker+Invalid, 45.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3065 IncrementalHoareTripleChecker+Unchecked, 13907 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16622 IncrementalHoareTripleChecker+Invalid, 19860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 1496 mSDtfsCounter, 16622 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2413 GetRequests, 1427 SyntacticMatches, 62 SemanticMatches, 924 ConstructedPredicates, 44 IntricatePredicates, 0 DeprecatedPredicates, 10962 ImplicationChecksByTransitivity, 168.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=33, InterpolantAutomatonStates: 452, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 155 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 165.7s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 3211 ConstructedInterpolants, 264 QuantifiedInterpolants, 52212 SizeOfPredicates, 100 NumberOfNonLiveVariables, 6550 ConjunctsInSsa, 942 ConjunctsInUnsatCore, 70 InterpolantComputations, 19 PerfectInterpolantSequences, 957/1601 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-23 18:43:30,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bed94a-6bd0-4a08-bf58-a580611e4787/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE