./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB --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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:12:35,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:12:35,806 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:12:35,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:12:35,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:12:35,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:12:35,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:12:35,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:12:35,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:12:35,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:12:35,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:12:35,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:12:35,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:12:35,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:12:35,857 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:12:35,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:12:35,858 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:12:35,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:12:35,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:12:35,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:12:35,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:12:35,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:12:35,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:12:35,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:12:35,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:12:35,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:12:35,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:12:35,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:12:35,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:12:35,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:12:35,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:12:35,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:12:35,861 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_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2024-11-28 04:12:36,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:12:36,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:12:36,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:12:36,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:12:36,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:12:36,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-11-28 04:12:39,951 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/data/cfd46086d/f8d015fb518f45d4a436ed7fb72a2d05/FLAGdfa4d3c90 [2024-11-28 04:12:40,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:12:40,352 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-11-28 04:12:40,366 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/data/cfd46086d/f8d015fb518f45d4a436ed7fb72a2d05/FLAGdfa4d3c90 [2024-11-28 04:12:40,384 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/data/cfd46086d/f8d015fb518f45d4a436ed7fb72a2d05 [2024-11-28 04:12:40,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:12:40,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:12:40,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:12:40,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:12:40,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:12:40,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:40,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf4e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40, skipping insertion in model container [2024-11-28 04:12:40,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:40,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:12:40,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:12:40,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:12:40,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:12:40,987 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:12:40,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40 WrapperNode [2024-11-28 04:12:40,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:12:40,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:12:40,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:12:40,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:12:40,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,037 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2024-11-28 04:12:41,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:12:41,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:12:41,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:12:41,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:12:41,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,074 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-28 04:12:41,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:12:41,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:12:41,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:12:41,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:12:41,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (1/1) ... [2024-11-28 04:12:41,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:12:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:41,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:12:41,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:12:41,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:12:41,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:12:41,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:12:41,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:12:41,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:12:41,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:12:41,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:12:41,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:12:41,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:12:41,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:12:41,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:12:41,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:12:41,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:12:41,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:12:41,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:12:41,416 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:12:41,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:12:41,859 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-28 04:12:41,859 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:12:41,880 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:12:41,880 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 04:12:41,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:12:41 BoogieIcfgContainer [2024-11-28 04:12:41,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:12:41,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:12:41,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:12:41,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:12:41,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:12:40" (1/3) ... [2024-11-28 04:12:41,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276b325e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:12:41, skipping insertion in model container [2024-11-28 04:12:41,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:40" (2/3) ... [2024-11-28 04:12:41,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276b325e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:12:41, skipping insertion in model container [2024-11-28 04:12:41,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:12:41" (3/3) ... [2024-11-28 04:12:41,896 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2024-11-28 04:12:41,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:12:41,917 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all.i that has 1 procedures, 67 locations, 1 initial locations, 6 loop locations, and 21 error locations. [2024-11-28 04:12:41,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:12:41,996 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;@622dbef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:12:41,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-28 04:12:42,003 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-28 04:12:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:12:42,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:42,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:12:42,013 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-28 04:12:42,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:42,022 INFO L85 PathProgramCache]: Analyzing trace with hash 889601162, now seen corresponding path program 1 times [2024-11-28 04:12:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924016888] [2024-11-28 04:12:42,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:42,302 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-28 04:12:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924016888] [2024-11-28 04:12:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924016888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:42,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:12:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455650931] [2024-11-28 04:12:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:42,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:12:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:42,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:12:42,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:12:42,350 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-28 04:12:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:42,469 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-28 04:12:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:12:42,474 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-28 04:12:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:42,482 INFO L225 Difference]: With dead ends: 64 [2024-11-28 04:12:42,483 INFO L226 Difference]: Without dead ends: 61 [2024-11-28 04:12:42,485 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-28 04:12:42,491 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-28 04:12:42,492 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-28 04:12:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-28 04:12:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-28 04:12:42,526 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-28 04:12:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-28 04:12:42,532 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 6 [2024-11-28 04:12:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:42,533 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-28 04:12:42,533 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-28 04:12:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-28 04:12:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:12:42,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:42,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:12:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:12:42,535 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-28 04:12:42,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:42,536 INFO L85 PathProgramCache]: Analyzing trace with hash 889601163, now seen corresponding path program 1 times [2024-11-28 04:12:42,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:42,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896758270] [2024-11-28 04:12:42,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:42,724 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-28 04:12:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896758270] [2024-11-28 04:12:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896758270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:12:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748265880] [2024-11-28 04:12:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:42,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:12:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:42,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:12:42,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:12:42,728 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-28 04:12:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:42,793 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-28 04:12:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:12:42,800 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-28 04:12:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:42,801 INFO L225 Difference]: With dead ends: 59 [2024-11-28 04:12:42,801 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 04:12:42,801 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-28 04:12:42,827 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-28 04:12:42,828 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-28 04:12:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 04:12:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-28 04:12:42,834 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-28 04:12:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-28 04:12:42,836 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 6 [2024-11-28 04:12:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:42,836 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-28 04:12:42,836 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-28 04:12:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-28 04:12:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:12:42,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:42,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:12:42,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:12:42,840 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-28 04:12:42,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 346343986, now seen corresponding path program 1 times [2024-11-28 04:12:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634743009] [2024-11-28 04:12:42,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:42,933 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-28 04:12:42,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:42,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634743009] [2024-11-28 04:12:42,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634743009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:42,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:42,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:12:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593867566] [2024-11-28 04:12:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:42,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:12:42,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:42,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:12:42,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:12:42,936 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-28 04:12:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:42,955 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-28 04:12:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:12:42,956 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-28 04:12:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:42,959 INFO L225 Difference]: With dead ends: 70 [2024-11-28 04:12:42,960 INFO L226 Difference]: Without dead ends: 70 [2024-11-28 04:12:42,960 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-28 04:12:42,961 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-28 04:12:42,961 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-28 04:12:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-28 04:12:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-28 04:12:42,975 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-28 04:12:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-28 04:12:42,976 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 9 [2024-11-28 04:12:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:42,979 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-28 04:12:42,979 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-28 04:12:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-28 04:12:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:12:42,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:42,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:12:42,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:12:42,980 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-28 04:12:42,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1759663698, now seen corresponding path program 1 times [2024-11-28 04:12:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703103450] [2024-11-28 04:12:42,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:43,152 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-28 04:12:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703103450] [2024-11-28 04:12:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703103450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:12:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656257440] [2024-11-28 04:12:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:12:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:43,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:12:43,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:12:43,154 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-28 04:12:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:43,307 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-28 04:12:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:12:43,307 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-28 04:12:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:43,308 INFO L225 Difference]: With dead ends: 59 [2024-11-28 04:12:43,308 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 04:12:43,308 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-28 04:12:43,309 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-28 04:12:43,310 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-28 04:12:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 04:12:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-28 04:12:43,317 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-28 04:12:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-28 04:12:43,318 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 10 [2024-11-28 04:12:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:43,318 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-28 04:12:43,318 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-28 04:12:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-28 04:12:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:12:43,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:43,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:12:43,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:12:43,319 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-28 04:12:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1759663697, now seen corresponding path program 1 times [2024-11-28 04:12:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444610594] [2024-11-28 04:12:43,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:43,642 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-28 04:12:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444610594] [2024-11-28 04:12:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444610594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:43,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:12:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126432478] [2024-11-28 04:12:43,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:12:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:43,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:12:43,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:12:43,648 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-28 04:12:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:43,761 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-28 04:12:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:12:43,762 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-28 04:12:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:43,762 INFO L225 Difference]: With dead ends: 58 [2024-11-28 04:12:43,762 INFO L226 Difference]: Without dead ends: 58 [2024-11-28 04:12:43,763 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-28 04:12:43,766 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-28 04:12:43,766 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-28 04:12:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-28 04:12:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-28 04:12:43,774 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-28 04:12:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-28 04:12:43,775 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 10 [2024-11-28 04:12:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:43,778 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-28 04:12:43,778 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-28 04:12:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-28 04:12:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 04:12:43,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:43,779 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-28 04:12:43,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:12:43,780 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-28 04:12:43,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash -698202142, now seen corresponding path program 1 times [2024-11-28 04:12:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197064742] [2024-11-28 04:12:43,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:43,910 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-28 04:12:43,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197064742] [2024-11-28 04:12:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197064742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324885529] [2024-11-28 04:12:43,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:43,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:43,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:43,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:43,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:12:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:44,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:12:44,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:44,168 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-28 04:12:44,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:12:44,264 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-28 04:12:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324885529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:12:44,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:12:44,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 04:12:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477473706] [2024-11-28 04:12:44,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:12:44,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:12:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:44,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:12:44,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:12:44,269 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-28 04:12:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:44,293 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-28 04:12:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:12:44,294 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-28 04:12:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:44,295 INFO L225 Difference]: With dead ends: 67 [2024-11-28 04:12:44,295 INFO L226 Difference]: Without dead ends: 67 [2024-11-28 04:12:44,296 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-28 04:12:44,297 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-28 04:12:44,297 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-28 04:12:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-28 04:12:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-28 04:12:44,301 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-28 04:12:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-28 04:12:44,303 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 18 [2024-11-28 04:12:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:44,303 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-28 04:12:44,303 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-28 04:12:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-28 04:12:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 04:12:44,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:44,304 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-28 04:12:44,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:12:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:44,505 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-28 04:12:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319118, now seen corresponding path program 2 times [2024-11-28 04:12:44,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657906566] [2024-11-28 04:12:44,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:12:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:44,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:12:44,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:12:44,569 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-28 04:12:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657906566] [2024-11-28 04:12:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657906566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:44,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:44,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:12:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978774705] [2024-11-28 04:12:44,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:44,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:12:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:44,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:12:44,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:12:44,571 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:12:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:44,639 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2024-11-28 04:12:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:12:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 04:12:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:44,644 INFO L225 Difference]: With dead ends: 91 [2024-11-28 04:12:44,644 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 04:12:44,645 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-28 04:12:44,646 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 22 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:44,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:12:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 04:12:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2024-11-28 04:12:44,653 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-28 04:12:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-28 04:12:44,658 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 27 [2024-11-28 04:12:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:44,658 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-28 04:12:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:12:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-28 04:12:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 04:12:44,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:44,659 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-28 04:12:44,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:12:44,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:44,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319049, now seen corresponding path program 1 times [2024-11-28 04:12:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:44,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030168345] [2024-11-28 04:12:44,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:44,958 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-28 04:12:44,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030168345] [2024-11-28 04:12:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030168345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:12:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464959423] [2024-11-28 04:12:44,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:44,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:12:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:44,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:12:44,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:12:44,960 INFO L87 Difference]: Start difference. First operand 70 states and 76 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-28 04:12:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:45,278 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-11-28 04:12:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:12:45,279 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-28 04:12:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:45,280 INFO L225 Difference]: With dead ends: 73 [2024-11-28 04:12:45,280 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 04:12:45,280 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-28 04:12:45,281 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:45,281 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.2s Time] [2024-11-28 04:12:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 04:12:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 04:12:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 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-28 04:12:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-28 04:12:45,286 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 27 [2024-11-28 04:12:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:45,287 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-28 04:12:45,287 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-28 04:12:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-28 04:12:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 04:12:45,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:45,288 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-28 04:12:45,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:12:45,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:45,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319048, now seen corresponding path program 1 times [2024-11-28 04:12:45,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:45,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143185716] [2024-11-28 04:12:45,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:45,794 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-28 04:12:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:45,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143185716] [2024-11-28 04:12:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143185716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:45,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:12:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267555545] [2024-11-28 04:12:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:45,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:12:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:12:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:12:45,796 INFO L87 Difference]: Start difference. First operand 73 states and 82 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-28 04:12:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:46,160 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-28 04:12:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:12:46,160 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-28 04:12:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:46,161 INFO L225 Difference]: With dead ends: 73 [2024-11-28 04:12:46,161 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 04:12:46,161 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-28 04:12:46,162 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-28 04:12:46,162 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-28 04:12:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 04:12:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 04:12:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 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-28 04:12:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-28 04:12:46,171 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 27 [2024-11-28 04:12:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:46,171 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-28 04:12:46,175 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-28 04:12:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-28 04:12:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:12:46,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:46,176 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-28 04:12:46,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:12:46,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:46,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:46,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1983181814, now seen corresponding path program 1 times [2024-11-28 04:12:46,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:46,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580731589] [2024-11-28 04:12:46,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:46,440 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-28 04:12:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580731589] [2024-11-28 04:12:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580731589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:12:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261012992] [2024-11-28 04:12:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:12:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:46,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:12:46,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:12:46,443 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-28 04:12:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:46,736 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-11-28 04:12:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:12:46,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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 29 [2024-11-28 04:12:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:46,737 INFO L225 Difference]: With dead ends: 74 [2024-11-28 04:12:46,737 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 04:12:46,738 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-28 04:12:46,738 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:46,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 216 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:12:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 04:12:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 04:12:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 73 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-28 04:12:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-28 04:12:46,744 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 29 [2024-11-28 04:12:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:46,744 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-28 04:12:46,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-28 04:12:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-28 04:12:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:12:46,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:46,745 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-28 04:12:46,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:12:46,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:46,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1983181813, now seen corresponding path program 1 times [2024-11-28 04:12:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:46,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969242991] [2024-11-28 04:12:46,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:12:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969242991] [2024-11-28 04:12:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969242991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041251279] [2024-11-28 04:12:46,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:46,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:46,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:46,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:46,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:12:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:47,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:12:47,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:47,210 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-28 04:12:47,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:12:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041251279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:47,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:12:47,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-28 04:12:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411088934] [2024-11-28 04:12:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:47,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:12:47,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:47,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:12:47,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:12:47,217 INFO L87 Difference]: Start difference. First operand 74 states and 83 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-28 04:12:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:47,262 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-28 04:12:47,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:12:47,264 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-28 04:12:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:47,265 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:12:47,265 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 04:12:47,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-28 04:12:47,266 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:47,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 118 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:12:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 04:12:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2024-11-28 04:12:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.360655737704918) internal successors, (83), 74 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-28 04:12:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-28 04:12:47,270 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 29 [2024-11-28 04:12:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:47,270 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-28 04:12:47,271 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-28 04:12:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-28 04:12:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 04:12:47,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:47,272 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-28 04:12:47,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:12:47,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:47,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:47,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash -99859533, now seen corresponding path program 1 times [2024-11-28 04:12:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483681624] [2024-11-28 04:12:47,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 04:12:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483681624] [2024-11-28 04:12:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483681624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:47,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:47,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:12:47,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906697991] [2024-11-28 04:12:47,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:47,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:12:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:47,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:12:47,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:12:47,644 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-28 04:12:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:47,696 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-28 04:12:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:12:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-28 04:12:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:47,698 INFO L225 Difference]: With dead ends: 89 [2024-11-28 04:12:47,698 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 04:12:47,698 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-28 04:12:47,699 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:47,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 155 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:12:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 04:12:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2024-11-28 04:12:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 76 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-28 04:12:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-11-28 04:12:47,710 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 34 [2024-11-28 04:12:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:47,711 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-11-28 04:12:47,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-28 04:12:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-11-28 04:12:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 04:12:47,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:47,712 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-28 04:12:47,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:12:47,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash -99859464, now seen corresponding path program 1 times [2024-11-28 04:12:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458451478] [2024-11-28 04:12:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:47,981 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-28 04:12:47,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:47,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458451478] [2024-11-28 04:12:47,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458451478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:12:47,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:12:47,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:12:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637368141] [2024-11-28 04:12:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:12:47,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:12:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:47,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:12:47,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:12:47,983 INFO L87 Difference]: Start difference. First operand 77 states and 85 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-28 04:12:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:48,281 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-11-28 04:12:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:12:48,282 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-28 04:12:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:48,282 INFO L225 Difference]: With dead ends: 80 [2024-11-28 04:12:48,283 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 04:12:48,283 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-28 04:12:48,283 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 246 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-28 04:12:48,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 246 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:12:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 04:12:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-28 04:12:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.378787878787879) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:12:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2024-11-28 04:12:48,291 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 34 [2024-11-28 04:12:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:48,291 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2024-11-28 04:12:48,291 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-28 04:12:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2024-11-28 04:12:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 04:12:48,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:48,296 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-28 04:12:48,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:12:48,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:48,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash -99859463, now seen corresponding path program 1 times [2024-11-28 04:12:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109765788] [2024-11-28 04:12:48,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:48,542 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-28 04:12:48,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109765788] [2024-11-28 04:12:48,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109765788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099213062] [2024-11-28 04:12:48,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:48,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:48,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:48,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:12:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:48,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:12:48,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:12:48,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:12:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:12:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099213062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:12:48,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:12:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-28 04:12:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909707826] [2024-11-28 04:12:48,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:12:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:12:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:48,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:12:48,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:12:48,955 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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-28 04:12:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:49,043 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2024-11-28 04:12:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:12:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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-28 04:12:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:49,044 INFO L225 Difference]: With dead ends: 125 [2024-11-28 04:12:49,044 INFO L226 Difference]: Without dead ends: 125 [2024-11-28 04:12:49,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:12:49,045 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 161 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:49,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 204 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:12:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-28 04:12:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2024-11-28 04:12:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.364864864864865) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:12:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2024-11-28 04:12:49,050 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 34 [2024-11-28 04:12:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:49,051 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2024-11-28 04:12:49,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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-28 04:12:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2024-11-28 04:12:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 04:12:49,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:49,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:12:49,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:12:49,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:49,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:49,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1315275253, now seen corresponding path program 1 times [2024-11-28 04:12:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:49,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726562908] [2024-11-28 04:12:49,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:49,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:12:49,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:49,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726562908] [2024-11-28 04:12:49,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726562908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018389186] [2024-11-28 04:12:49,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:49,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:49,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:12:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:49,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:12:49,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:12:49,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:12:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:12:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018389186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:12:49,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:12:49,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-28 04:12:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513106325] [2024-11-28 04:12:49,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:12:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:12:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:49,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:12:49,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:12:49,745 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:12:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:49,840 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2024-11-28 04:12:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:12:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-28 04:12:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:49,842 INFO L225 Difference]: With dead ends: 122 [2024-11-28 04:12:49,842 INFO L226 Difference]: Without dead ends: 122 [2024-11-28 04:12:49,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:12:49,843 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 47 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:49,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 253 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:12:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-28 04:12:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2024-11-28 04:12:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 92 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-28 04:12:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-28 04:12:49,847 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 35 [2024-11-28 04:12:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:49,848 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-28 04:12:49,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:12:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-28 04:12:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 04:12:49,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:49,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:12:49,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 04:12:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:50,050 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-28 04:12:50,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1315275184, now seen corresponding path program 1 times [2024-11-28 04:12:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462214824] [2024-11-28 04:12:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:12:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462214824] [2024-11-28 04:12:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462214824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420118182] [2024-11-28 04:12:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:51,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:51,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:12:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:51,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 04:12:51,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:51,462 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:12:51,463 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-28 04:12:51,587 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-28 04:12:51,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:51,877 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-28 04:12:52,005 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 21 treesize of output 9 [2024-11-28 04:12:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:12:52,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:12:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:12:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420118182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:12:52,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:12:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 37 [2024-11-28 04:12:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320941539] [2024-11-28 04:12:52,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:12:52,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 04:12:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:52,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 04:12:52,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1265, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 04:12:52,800 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 38 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-28 04:12:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:54,039 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2024-11-28 04:12:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:12:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 38 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 35 [2024-11-28 04:12:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:54,042 INFO L225 Difference]: With dead ends: 144 [2024-11-28 04:12:54,042 INFO L226 Difference]: Without dead ends: 144 [2024-11-28 04:12:54,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=266, Invalid=2086, Unknown=0, NotChecked=0, Total=2352 [2024-11-28 04:12:54,045 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 162 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:54,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 715 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:12:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-28 04:12:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 103. [2024-11-28 04:12:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 102 states have internal predecessors, (122), 0 states have call successors, (0), 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-28 04:12:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2024-11-28 04:12:54,053 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 35 [2024-11-28 04:12:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:54,054 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2024-11-28 04:12:54,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 38 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-28 04:12:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2024-11-28 04:12:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 04:12:54,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:54,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:12:54,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:12:54,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:54,259 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:12:54,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1315275183, now seen corresponding path program 1 times [2024-11-28 04:12:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569966721] [2024-11-28 04:12:54,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:12:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569966721] [2024-11-28 04:12:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569966721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476506459] [2024-11-28 04:12:55,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:55,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:55,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:55,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:12:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:55,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-28 04:12:55,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:55,872 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-28 04:12:56,123 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:12:56,124 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-28 04:12:56,138 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-28 04:12:56,337 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-28 04:12:56,349 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-28 04:12:56,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:56,752 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 25 treesize of output 13 [2024-11-28 04:12:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:56,761 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-28 04:12:56,888 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-28 04:12:56,896 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-28 04:12:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:12:57,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:12:57,369 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_783 (Array Int Int))) (or (not (= v_ArrVal_783 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_783 |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_783) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_783 (Array Int Int))) (or (not (= v_ArrVal_783 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_783 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_782 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_783) |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_782)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2024-11-28 04:12:58,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:58,277 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-28 04:12:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2024-11-28 04:12:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476506459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:12:58,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:12:58,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 47 [2024-11-28 04:12:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067843314] [2024-11-28 04:12:58,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:12:58,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-28 04:12:58,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:58,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-28 04:12:58,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2024, Unknown=1, NotChecked=90, Total=2256 [2024-11-28 04:12:58,546 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 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-28 04:13:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:00,783 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2024-11-28 04:13:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:13:00,784 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 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 35 [2024-11-28 04:13:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:00,784 INFO L225 Difference]: With dead ends: 158 [2024-11-28 04:13:00,784 INFO L226 Difference]: Without dead ends: 158 [2024-11-28 04:13:00,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=286, Invalid=3257, Unknown=1, NotChecked=116, Total=3660 [2024-11-28 04:13:00,787 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 132 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:00,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1018 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1165 Invalid, 0 Unknown, 90 Unchecked, 1.1s Time] [2024-11-28 04:13:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-28 04:13:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 111. [2024-11-28 04:13:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 110 states have internal predecessors, (133), 0 states have call successors, (0), 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-28 04:13:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2024-11-28 04:13:00,792 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 35 [2024-11-28 04:13:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:00,793 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2024-11-28 04:13:00,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 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-28 04:13:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2024-11-28 04:13:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 04:13:00,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:00,795 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] [2024-11-28 04:13:00,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:13:00,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 04:13:00,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:00,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:00,997 INFO L85 PathProgramCache]: Analyzing trace with hash -554884333, now seen corresponding path program 2 times [2024-11-28 04:13:00,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:00,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682715547] [2024-11-28 04:13:00,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:13:00,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:01,036 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:13:01,036 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:13:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 04:13:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:01,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682715547] [2024-11-28 04:13:01,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682715547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:13:01,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:13:01,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:13:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586746751] [2024-11-28 04:13:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:13:01,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:13:01,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:01,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:13:01,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:13:01,389 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:13:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:01,653 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2024-11-28 04:13:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:13:01,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-28 04:13:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:01,654 INFO L225 Difference]: With dead ends: 111 [2024-11-28 04:13:01,654 INFO L226 Difference]: Without dead ends: 111 [2024-11-28 04:13:01,654 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-28 04:13:01,655 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 322 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:01,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 322 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:13:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-28 04:13:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-28 04:13:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 110 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-28 04:13:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2024-11-28 04:13:01,660 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 39 [2024-11-28 04:13:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:01,660 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2024-11-28 04:13:01,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:13:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2024-11-28 04:13:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 04:13:01,661 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:01,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 04:13:01,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:13:01,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:01,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1402659556, now seen corresponding path program 2 times [2024-11-28 04:13:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:01,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838267710] [2024-11-28 04:13:01,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:13:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:01,693 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:13:01,693 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:13:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 04:13:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838267710] [2024-11-28 04:13:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838267710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:01,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557365859] [2024-11-28 04:13:01,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:13:01,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:01,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:01,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:13:02,011 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:13:02,011 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:13:02,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:13:02,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 04:13:02,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:13:02,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557365859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:13:02,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:13:02,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-28 04:13:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729541956] [2024-11-28 04:13:02,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:13:02,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:13:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:02,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:13:02,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:13:02,175 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:13:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:02,215 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2024-11-28 04:13:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:13:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-28 04:13:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:02,217 INFO L225 Difference]: With dead ends: 89 [2024-11-28 04:13:02,217 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 04:13:02,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:13:02,218 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:02,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 130 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:13:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 04:13:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-11-28 04:13:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 81 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-28 04:13:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-28 04:13:02,227 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 43 [2024-11-28 04:13:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:02,228 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-28 04:13:02,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:13:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-28 04:13:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 04:13:02,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:02,229 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-28 04:13:02,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:13:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:02,429 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:02,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -330378733, now seen corresponding path program 1 times [2024-11-28 04:13:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:02,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459394547] [2024-11-28 04:13:02,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:13:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459394547] [2024-11-28 04:13:02,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459394547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2240651] [2024-11-28 04:13:02,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:02,763 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:02,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:13:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:02,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:13:03,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:13:03,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:13:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2240651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:03,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-28 04:13:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358115198] [2024-11-28 04:13:03,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:13:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:03,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:13:03,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:13:03,111 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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-28 04:13:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:03,288 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-28 04:13:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:13:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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-28 04:13:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:03,290 INFO L225 Difference]: With dead ends: 86 [2024-11-28 04:13:03,290 INFO L226 Difference]: Without dead ends: 86 [2024-11-28 04:13:03,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:13:03,291 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 105 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:03,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 329 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:13:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-28 04:13:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-28 04:13:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 81 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-28 04:13:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-28 04:13:03,297 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 45 [2024-11-28 04:13:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:03,298 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-28 04:13:03,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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-28 04:13:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-28 04:13:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:13:03,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:03,299 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-28 04:13:03,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:13:03,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-28 04:13:03,500 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-28 04:13:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash -145168064, now seen corresponding path program 1 times [2024-11-28 04:13:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232268662] [2024-11-28 04:13:03,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:13:05,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:05,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232268662] [2024-11-28 04:13:05,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232268662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:05,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930151406] [2024-11-28 04:13:05,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:05,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:05,063 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:05,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:13:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:05,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-28 04:13:05,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:05,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:13:05,477 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-28 04:13:05,662 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-28 04:13:06,018 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-28 04:13:06,025 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 26 treesize of output 14 [2024-11-28 04:13:06,237 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 20 treesize of output 8 [2024-11-28 04:13:06,400 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-28 04:13:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:13:06,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:06,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-28 04:13:07,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (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_1152) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-28 04:13:07,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:07,062 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 32 treesize of output 33 [2024-11-28 04:13:07,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:07,076 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 58 treesize of output 61 [2024-11-28 04:13:07,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-28 04:13:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 04:13:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930151406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:07,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 22] total 62 [2024-11-28 04:13:07,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11984941] [2024-11-28 04:13:07,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:07,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-28 04:13:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:07,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-28 04:13:07,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3319, Unknown=29, NotChecked=234, Total=3782 [2024-11-28 04:13:07,751 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 62 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 62 states have internal predecessors, (127), 0 states have call successors, (0), 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-28 04:13:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:10,238 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-28 04:13:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 04:13:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 62 states have internal predecessors, (127), 0 states have call successors, (0), 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-28 04:13:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:10,239 INFO L225 Difference]: With dead ends: 89 [2024-11-28 04:13:10,240 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 04:13:10,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=465, Invalid=6156, Unknown=29, NotChecked=322, Total=6972 [2024-11-28 04:13:10,242 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 122 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:10,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1195 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1543 Invalid, 0 Unknown, 139 Unchecked, 1.2s Time] [2024-11-28 04:13:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 04:13:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-11-28 04:13:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:13:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-28 04:13:10,246 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 48 [2024-11-28 04:13:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:10,247 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-28 04:13:10,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 62 states have internal predecessors, (127), 0 states have call successors, (0), 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-28 04:13:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-28 04:13:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 04:13:10,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:10,248 INFO L218 NwaCegarLoop]: trace histogram [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-28 04:13:10,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:13:10,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 04:13:10,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1628288943, now seen corresponding path program 1 times [2024-11-28 04:13:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823939415] [2024-11-28 04:13:10,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 04:13:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823939415] [2024-11-28 04:13:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823939415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684545812] [2024-11-28 04:13:10,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:10,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:10,641 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:10,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:13:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:10,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:13:10,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 04:13:10,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 04:13:10,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684545812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:10,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:10,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-28 04:13:10,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069823034] [2024-11-28 04:13:10,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:10,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:13:10,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:10,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:13:10,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:13:10,956 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-28 04:13:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:11,024 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-28 04:13:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:13:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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 52 [2024-11-28 04:13:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:11,026 INFO L225 Difference]: With dead ends: 79 [2024-11-28 04:13:11,026 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 04:13:11,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:13:11,028 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:11,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:13:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 04:13:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-28 04:13:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 78 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-28 04:13:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-28 04:13:11,032 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 52 [2024-11-28 04:13:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:11,032 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-28 04:13:11,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-28 04:13:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-28 04:13:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 04:13:11,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:11,033 INFO L218 NwaCegarLoop]: trace histogram [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-28 04:13:11,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 04:13:11,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 04:13:11,234 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1628289012, now seen corresponding path program 1 times [2024-11-28 04:13:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815366017] [2024-11-28 04:13:11,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:13:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815366017] [2024-11-28 04:13:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815366017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:13,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251481789] [2024-11-28 04:13:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:13,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:13,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:13,527 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:13,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:13:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:13,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 04:13:13,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:13,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:13:13,895 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-28 04:13:14,020 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-28 04:13:14,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:14,271 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 26 treesize of output 14 [2024-11-28 04:13:14,528 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:13:14,529 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-28 04:13:14,747 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-28 04:13:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:13:14,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:14,926 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 04:13:14,927 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-28 04:13:14,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (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_1365) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-28 04:13:14,946 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (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_1365) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-28 04:13:14,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (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)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1365) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2024-11-28 04:13:14,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (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_1365) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-28 04:13:14,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1363 Int) (v_ArrVal_1365 (Array Int Int))) (let ((.cse1 (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_1363))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1365) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) is different from false [2024-11-28 04:13:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2024-11-28 04:13:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251481789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:15,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 19] total 53 [2024-11-28 04:13:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482438188] [2024-11-28 04:13:15,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-28 04:13:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:15,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-28 04:13:15,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2229, Unknown=5, NotChecked=490, Total=2862 [2024-11-28 04:13:15,277 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 54 states, 53 states have (on average 2.339622641509434) internal successors, (124), 54 states have internal predecessors, (124), 0 states have call successors, (0), 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-28 04:13:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:17,721 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-28 04:13:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 04:13:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.339622641509434) internal successors, (124), 54 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-28 04:13:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:17,723 INFO L225 Difference]: With dead ends: 85 [2024-11-28 04:13:17,723 INFO L226 Difference]: Without dead ends: 85 [2024-11-28 04:13:17,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=392, Invalid=5025, Unknown=5, NotChecked=740, Total=6162 [2024-11-28 04:13:17,726 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 167 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:17,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1075 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1463 Invalid, 0 Unknown, 314 Unchecked, 1.1s Time] [2024-11-28 04:13:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-28 04:13:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-11-28 04:13:17,732 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-28 04:13:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-28 04:13:17,735 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 52 [2024-11-28 04:13:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:17,735 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-28 04:13:17,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.339622641509434) internal successors, (124), 54 states have internal predecessors, (124), 0 states have call successors, (0), 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-28 04:13:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-28 04:13:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 04:13:17,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:17,737 INFO L218 NwaCegarLoop]: trace histogram [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-28 04:13:17,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 04:13:17,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:13:17,937 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1628289013, now seen corresponding path program 1 times [2024-11-28 04:13:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568386430] [2024-11-28 04:13:17,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:13:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568386430] [2024-11-28 04:13:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568386430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603307013] [2024-11-28 04:13:20,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:20,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:20,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:20,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:20,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:13:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:20,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-28 04:13:20,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:20,967 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-28 04:13:21,125 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:13:21,125 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-28 04:13:21,130 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-28 04:13:21,318 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-28 04:13:21,326 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-28 04:13:21,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:21,723 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-28 04:13:21,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:21,728 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 25 treesize of output 13 [2024-11-28 04:13:22,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:13:22,041 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 62 treesize of output 57 [2024-11-28 04:13:22,047 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 30 treesize of output 13 [2024-11-28 04:13:22,242 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-28 04:13:22,249 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-28 04:13:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 04:13:22,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:22,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1478 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:13:22,794 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))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1478 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-28 04:13:22,818 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_1478 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:13:22,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1476 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1474) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1476)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= v_ArrVal_1474 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1474 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1476)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1474) .cse3 v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1477) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (not (= v_ArrVal_1474 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1474 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-28 04:13:22,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| v_ArrVal_1476)) .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)))))) is different from false [2024-11-28 04:13:23,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse2 .cse1)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|) (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| v_ArrVal_1476)) .cse0 v_ArrVal_1477) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1)))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|) (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474))))))))) is different from false [2024-11-28 04:13:23,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select .cse2 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| v_ArrVal_1476)) .cse0 v_ArrVal_1477) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|) (forall ((v_ArrVal_1474 (Array Int Int))) (or (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474)) (forall ((v_ArrVal_1478 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))))))))) is different from false [2024-11-28 04:13:23,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse1)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| v_ArrVal_1476)) .cse0 v_ArrVal_1477) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int)) (or (forall ((v_ArrVal_1474 (Array Int Int))) (or (forall ((v_ArrVal_1478 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1474) .cse0 v_ArrVal_1478) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select v_ArrVal_1474 |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)) v_ArrVal_1474)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)))))) is different from false [2024-11-28 04:13:23,262 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 38 [2024-11-28 04:13:23,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:23,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:23,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:13:23,301 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 13 [2024-11-28 04:13:23,315 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:23,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:23,325 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2024-11-28 04:13:23,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:23,333 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 37 treesize of output 35 [2024-11-28 04:13:23,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:23,341 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 16 [2024-11-28 04:13:23,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:23,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:23,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:13:23,362 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 20 treesize of output 12 [2024-11-28 04:13:23,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:23,987 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-28 04:13:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-11-28 04:13:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603307013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:24,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:24,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 22] total 62 [2024-11-28 04:13:24,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139075614] [2024-11-28 04:13:24,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:24,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-28 04:13:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:24,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-28 04:13:24,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2814, Unknown=27, NotChecked=904, Total=3906 [2024-11-28 04:13:24,291 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 63 states have internal predecessors, (137), 0 states have call successors, (0), 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-28 04:13:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:28,609 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-28 04:13:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 04:13:28,610 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 63 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-28 04:13:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:28,610 INFO L225 Difference]: With dead ends: 84 [2024-11-28 04:13:28,610 INFO L226 Difference]: Without dead ends: 84 [2024-11-28 04:13:28,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=423, Invalid=5127, Unknown=32, NotChecked=1224, Total=6806 [2024-11-28 04:13:28,613 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 218 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:28,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1256 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1934 Invalid, 0 Unknown, 560 Unchecked, 1.6s Time] [2024-11-28 04:13:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-28 04:13:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-11-28 04:13:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 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-28 04:13:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-28 04:13:28,616 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 52 [2024-11-28 04:13:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:28,617 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-28 04:13:28,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 63 states have internal predecessors, (137), 0 states have call successors, (0), 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-28 04:13:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-28 04:13:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:13:28,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:13:28,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 04:13:28,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 04:13:28,823 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1975759907, now seen corresponding path program 1 times [2024-11-28 04:13:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630736356] [2024-11-28 04:13:28,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 04:13:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630736356] [2024-11-28 04:13:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630736356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104216365] [2024-11-28 04:13:28,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:28,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:28,941 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:28,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:13:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:29,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:13:29,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 04:13:29,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 04:13:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104216365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:29,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:29,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-28 04:13:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924779534] [2024-11-28 04:13:29,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:29,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:13:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:29,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:13:29,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:13:29,288 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-28 04:13:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:29,358 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2024-11-28 04:13:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:13:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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 55 [2024-11-28 04:13:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:29,359 INFO L225 Difference]: With dead ends: 76 [2024-11-28 04:13:29,360 INFO L226 Difference]: Without dead ends: 76 [2024-11-28 04:13:29,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:13:29,361 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:29,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 165 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:13:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-28 04:13:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-28 04:13:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 75 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-28 04:13:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-11-28 04:13:29,366 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 55 [2024-11-28 04:13:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:29,366 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-11-28 04:13:29,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-28 04:13:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-11-28 04:13:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 04:13:29,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:29,367 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-28 04:13:29,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:13:29,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 04:13:29,568 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:29,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash 602977653, now seen corresponding path program 1 times [2024-11-28 04:13:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060590607] [2024-11-28 04:13:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:13:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060590607] [2024-11-28 04:13:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060590607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283729196] [2024-11-28 04:13:32,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:32,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:32,322 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:32,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:13:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:32,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-28 04:13:32,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:33,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:13:33,035 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-28 04:13:33,246 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-28 04:13:33,249 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-28 04:13:33,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:33,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 26 treesize of output 14 [2024-11-28 04:13:33,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:33,770 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 25 treesize of output 13 [2024-11-28 04:13:34,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:13:34,283 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-28 04:13:34,288 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-28 04:13:34,292 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-28 04:13:34,885 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-28 04:13:34,890 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-28 04:13:35,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:35,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:35,124 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-28 04:13:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:13:35,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:36,338 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 59 treesize of output 46 [2024-11-28 04:13:36,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (and (or .cse0 (< |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (forall ((v_ArrVal_1694 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (< .cse1 0)))) (or .cse0 (forall ((v_ArrVal_1692 (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_1692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (or (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) .cse0)))) is different from false [2024-11-28 04:13:36,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (and (or (< |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1) .cse0) (forall ((v_ArrVal_1694 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse1 0) (< .cse1 (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))))) (or .cse0 (forall ((v_ArrVal_1692 (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_1692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (or (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) .cse0)))) is different from false [2024-11-28 04:13:37,325 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 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (forall ((v_ArrVal_1690 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689) .cse3 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1692 (Array Int Int))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_1692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689))) (let ((.cse5 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse5 0) (< .cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))))))) (forall ((v_ArrVal_1689 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (< (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (< (select (select (store .cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))))))) is different from false [2024-11-28 04:13:37,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select .cse4 .cse0))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1689 (Array Int Int))) (or (< (select v_ArrVal_1689 .cse0) 1) (not (= v_ArrVal_1689 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1694 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (or (< .cse3 (+ 1 (select v_ArrVal_1689 .cse0))) (< .cse3 0)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1690 Int)) (or (forall ((v_ArrVal_1692 (Array Int Int))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1690)) .cse2 v_ArrVal_1692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1694 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0))))))) is different from false [2024-11-28 04:13:37,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1694 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse1 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1692 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1690)) .cse1 v_ArrVal_1692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1689 (Array Int Int))) (or (< (select v_ArrVal_1689 .cse2) 1) (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse1 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1694 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse1 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse4 (+ 1 (select v_ArrVal_1689 .cse2))) (< .cse4 0)))))))) (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1694 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1689) .cse1 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))))))) is different from false [2024-11-28 04:13:37,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1694 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1689) .cse1 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) 0))) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1690)) .cse1 v_ArrVal_1692) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1689 (Array Int Int))) (or (< (select v_ArrVal_1689 .cse2) 1) (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1689) .cse1 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) 0)) (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1694 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1689) .cse1 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))) (or (< .cse4 (+ (select v_ArrVal_1689 .cse2) 1)) (< .cse4 0)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))))) is different from false [2024-11-28 04:13:37,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select .cse4 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select v_ArrVal_1689 .cse1) 1) (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1694 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (or (< .cse3 0) (< .cse3 (+ (select v_ArrVal_1689 .cse1) 1))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1690 Int) (v_ArrVal_1692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1690)) .cse2 v_ArrVal_1692) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) .cse2)) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1694 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))))) is different from false [2024-11-28 04:13:37,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (select .cse3 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select v_ArrVal_1689 .cse1) 1) (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 0)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1694 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1690)) .cse2 v_ArrVal_1692) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse2)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= v_ArrVal_1689 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1689 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1694 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1689) .cse2 v_ArrVal_1694) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (or (< .cse4 0) (< .cse4 (+ (select v_ArrVal_1689 .cse1) 1)))))))))))) is different from false [2024-11-28 04:13:37,927 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 61 treesize of output 59 [2024-11-28 04:13:37,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:37,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:37,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:13:37,947 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 14 [2024-11-28 04:13:37,950 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 17 treesize of output 9 [2024-11-28 04:13:37,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:37,961 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:13:37,961 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-28 04:13:37,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:37,966 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 24 treesize of output 22 [2024-11-28 04:13:37,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:37,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:37,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:13:37,993 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 8 [2024-11-28 04:13:38,484 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:13:38,484 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-28 04:13:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 04:13:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283729196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:38,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29, 30] total 86 [2024-11-28 04:13:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493567078] [2024-11-28 04:13:38,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-28 04:13:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:38,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-28 04:13:38,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=5757, Unknown=33, NotChecked=1272, Total=7310 [2024-11-28 04:13:38,746 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 86 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 86 states have internal predecessors, (163), 0 states have call successors, (0), 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-28 04:13:41,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (<= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0)) (.cse7 (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_sll_update_at_~data#1|))) (and .cse0 (<= (select .cse1 .cse2) 0) (not (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~s~0#1.base|)) .cse4 .cse5 (= (select .cse6 4) 0) .cse7 .cse8 (= .cse9 .cse3) (<= |c_ULTIMATE.start_sll_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (or (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))) .cse8) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (forall ((v_ArrVal_1690 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689) .cse10 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1692 (Array Int Int))) (= .cse10 (select (select (store .cse11 .cse10 v_ArrVal_1692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689))) (let ((.cse12 (select (select (store .cse13 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse12 0) (< .cse12 (+ (select (select .cse13 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))))))) (= .cse1 .cse6) (forall ((v_ArrVal_1689 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689))) (or (not (= (store .cse6 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (< (select (select .cse14 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (< (select (select (store .cse14 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))))) (or (and (not .cse0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse3 4)) .cse4 (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select .cse1 4)) .cse7) (and .cse0 .cse5 .cse7)) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2024-11-28 04:13:42,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0))) (and .cse0 (<= (select .cse1 .cse2) 0) (not (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~s~0#1.base|)) .cse4 (= (select .cse5 4) 0) .cse6 (<= |c_ULTIMATE.start_sll_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (or (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (or (not (= (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))) .cse6) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (forall ((v_ArrVal_1690 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1694 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689) .cse8 v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1692 (Array Int Int))) (= .cse8 (select (select (store .cse9 .cse8 v_ArrVal_1692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (forall ((v_ArrVal_1689 (Array Int Int))) (or (not (= (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689))) (let ((.cse10 (select (select (store .cse11 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse10 0) (< .cse10 (+ (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))))))) (forall ((v_ArrVal_1689 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1689))) (or (not (= (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1689 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1689)) (< (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1690 Int) (v_ArrVal_1694 (Array Int Int))) (< (select (select (store .cse12 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1690)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1694) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))))) (let ((.cse13 (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_sll_update_at_~data#1|))) (or (and (not .cse0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse3 4)) (<= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select .cse1 4)) .cse13) (and .cse0 .cse4 .cse13))) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2024-11-28 04:13:45,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:45,097 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-28 04:13:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 04:13:45,098 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 86 states have internal predecessors, (163), 0 states have call successors, (0), 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-28 04:13:45,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:45,098 INFO L225 Difference]: With dead ends: 79 [2024-11-28 04:13:45,098 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 04:13:45,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=647, Invalid=11348, Unknown=35, NotChecked=2250, Total=14280 [2024-11-28 04:13:45,103 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 153 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:45,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1317 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2547 Invalid, 0 Unknown, 652 Unchecked, 2.0s Time] [2024-11-28 04:13:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 04:13:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2024-11-28 04:13:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 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-28 04:13:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-28 04:13:45,108 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 58 [2024-11-28 04:13:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:45,108 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-28 04:13:45,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 86 states have internal predecessors, (163), 0 states have call successors, (0), 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-28 04:13:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-28 04:13:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:13:45,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:45,109 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-28 04:13:45,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 04:13:45,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 04:13:45,310 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:45,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1512527744, now seen corresponding path program 1 times [2024-11-28 04:13:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:45,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766685801] [2024-11-28 04:13:45,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:45,662 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-28 04:13:45,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:45,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766685801] [2024-11-28 04:13:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766685801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:13:45,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:13:45,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:13:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443828879] [2024-11-28 04:13:45,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:13:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:13:45,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:45,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:13:45,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:13:45,665 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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-28 04:13:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:45,935 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2024-11-28 04:13:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:13:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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-28 04:13:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:45,936 INFO L225 Difference]: With dead ends: 74 [2024-11-28 04:13:45,936 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 04:13:45,937 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-28 04:13:45,937 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:45,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 192 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:13:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 04:13:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 04:13:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 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-28 04:13:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-28 04:13:45,941 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2024-11-28 04:13:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:45,941 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-28 04:13:45,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 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-28 04:13:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-28 04:13:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:13:45,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:45,942 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-28 04:13:45,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 04:13:45,943 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:45,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash -356277779, now seen corresponding path program 1 times [2024-11-28 04:13:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:45,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299442044] [2024-11-28 04:13:45,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:46,136 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-28 04:13:46,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:46,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299442044] [2024-11-28 04:13:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299442044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:13:46,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:13:46,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:13:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24434835] [2024-11-28 04:13:46,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:13:46,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:13:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:46,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:13:46,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:13:46,138 INFO L87 Difference]: Start difference. First operand 74 states and 76 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-28 04:13:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:46,327 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-28 04:13:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:13:46,328 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-28 04:13:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:46,329 INFO L225 Difference]: With dead ends: 76 [2024-11-28 04:13:46,329 INFO L226 Difference]: Without dead ends: 76 [2024-11-28 04:13:46,329 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-28 04:13:46,330 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 238 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-28 04:13:46,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 238 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:13:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-28 04:13:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-28 04:13:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 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-28 04:13:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-28 04:13:46,333 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2024-11-28 04:13:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:46,334 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-28 04:13:46,334 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-28 04:13:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-11-28 04:13:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:13:46,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:46,335 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-28 04:13:46,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 04:13:46,335 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:46,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:46,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1212185762, now seen corresponding path program 1 times [2024-11-28 04:13:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:46,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037373867] [2024-11-28 04:13:46,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:46,549 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-28 04:13:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037373867] [2024-11-28 04:13:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037373867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:13:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:13:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:13:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344087983] [2024-11-28 04:13:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:13:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:13:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:46,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:13:46,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:13:46,553 INFO L87 Difference]: Start difference. First operand 74 states and 75 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-28 04:13:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:46,772 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2024-11-28 04:13:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:13:46,773 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-28 04:13:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:46,773 INFO L225 Difference]: With dead ends: 75 [2024-11-28 04:13:46,773 INFO L226 Difference]: Without dead ends: 75 [2024-11-28 04:13:46,774 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-28 04:13:46,774 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-28 04:13:46,774 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-28 04:13:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-28 04:13:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-28 04:13:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 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-28 04:13:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-28 04:13:46,778 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2024-11-28 04:13:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:46,778 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-28 04:13:46,778 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-28 04:13:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-28 04:13:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:13:46,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:46,779 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-28 04:13:46,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 04:13:46,779 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:46,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 141172423, now seen corresponding path program 1 times [2024-11-28 04:13:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190799103] [2024-11-28 04:13:46,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:46,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 04:13:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190799103] [2024-11-28 04:13:48,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190799103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078568860] [2024-11-28 04:13:48,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:48,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:48,555 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:48,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:13:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:48,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-28 04:13:48,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:48,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:13:48,894 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-28 04:13:49,004 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-28 04:13:49,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:49,211 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 12 [2024-11-28 04:13:49,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:13:49,346 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-28 04:13:49,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:49,528 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-28 04:13:49,719 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:13:49,719 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-28 04:13:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 04:13:49,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:50,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:50,033 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 31 treesize of output 35 [2024-11-28 04:13:51,033 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 16 treesize of output 14 [2024-11-28 04:13:51,038 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 106 treesize of output 102 [2024-11-28 04:13:51,062 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 13 treesize of output 11 [2024-11-28 04:13:51,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:13:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:13:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078568860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:13:51,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:13:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 21] total 49 [2024-11-28 04:13:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472749745] [2024-11-28 04:13:51,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:13:51,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 04:13:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:13:51,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 04:13:51,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2278, Unknown=0, NotChecked=0, Total=2450 [2024-11-28 04:13:51,161 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 0 states have call successors, (0), 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-28 04:13:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:13:52,681 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-28 04:13:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 04:13:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 0 states have call successors, (0), 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-28 04:13:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:13:52,682 INFO L225 Difference]: With dead ends: 85 [2024-11-28 04:13:52,682 INFO L226 Difference]: Without dead ends: 85 [2024-11-28 04:13:52,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=304, Invalid=3728, Unknown=0, NotChecked=0, Total=4032 [2024-11-28 04:13:52,683 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:13:52,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 688 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 04:13:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-28 04:13:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-11-28 04:13:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 77 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-28 04:13:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-28 04:13:52,687 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2024-11-28 04:13:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:13:52,687 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-28 04:13:52,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 0 states have call successors, (0), 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-28 04:13:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-28 04:13:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:13:52,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:13:52,688 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-28 04:13:52,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:13:52,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:52,888 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:13:52,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:13:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 141172424, now seen corresponding path program 1 times [2024-11-28 04:13:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:13:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299026640] [2024-11-28 04:13:52,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:13:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:13:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:13:55,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299026640] [2024-11-28 04:13:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299026640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:13:55,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339948948] [2024-11-28 04:13:55,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:13:55,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:13:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:13:55,052 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:13:55,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:13:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:13:55,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-28 04:13:55,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:13:55,380 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-28 04:13:55,608 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:13:55,609 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 16 treesize of output 15 [2024-11-28 04:13:55,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:13:55,624 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-28 04:13:55,822 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-28 04:13:55,827 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-28 04:13:56,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:56,235 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 31 treesize of output 19 [2024-11-28 04:13:56,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:13:56,240 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 39 treesize of output 23 [2024-11-28 04:13:56,526 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:13:56,526 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 56 treesize of output 51 [2024-11-28 04:13:56,532 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 39 treesize of output 24 [2024-11-28 04:13:56,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:56,844 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 32 treesize of output 26 [2024-11-28 04:13:56,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:13:56,855 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 29 treesize of output 23 [2024-11-28 04:13:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 04:13:57,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:58,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2074 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2074))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2075 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2073)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_2075) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2074 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2074))))) (forall ((v_ArrVal_2074 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2074))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2073)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_2075) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2076) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2074 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2074))))))) is different from false [2024-11-28 04:14:00,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:00,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:00,699 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 2 case distinctions, treesize of input 37 treesize of output 43 [2024-11-28 04:14:00,709 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 58 treesize of output 56 [2024-11-28 04:14:00,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:00,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 88 treesize of output 82 [2024-11-28 04:14:00,731 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 11 treesize of output 9 [2024-11-28 04:14:00,734 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 9 treesize of output 7 [2024-11-28 04:14:00,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:00,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:00,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:14:00,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:00,763 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 30 treesize of output 28 [2024-11-28 04:14:00,794 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 38 [2024-11-28 04:14:00,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:00,802 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:00,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-28 04:14:01,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:14:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 2 times theorem prover too weak. 11 trivial. 3 not checked. [2024-11-28 04:14:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339948948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:14:01,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:14:01,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 70 [2024-11-28 04:14:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399115825] [2024-11-28 04:14:01,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:14:01,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-28 04:14:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:14:01,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-28 04:14:01,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4505, Unknown=92, NotChecked=136, Total=4970 [2024-11-28 04:14:01,609 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 71 states, 70 states have (on average 2.3857142857142857) internal successors, (167), 71 states have internal predecessors, (167), 0 states have call successors, (0), 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-28 04:14:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:14:05,049 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-11-28 04:14:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 04:14:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 2.3857142857142857) internal successors, (167), 71 states have internal predecessors, (167), 0 states have call successors, (0), 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-28 04:14:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:14:05,051 INFO L225 Difference]: With dead ends: 87 [2024-11-28 04:14:05,051 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 04:14:05,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=452, Invalid=6942, Unknown=92, NotChecked=170, Total=7656 [2024-11-28 04:14:05,053 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 99 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:14:05,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 916 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1883 Invalid, 0 Unknown, 70 Unchecked, 1.8s Time] [2024-11-28 04:14:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 04:14:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-28 04:14:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 79 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-28 04:14:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2024-11-28 04:14:05,056 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2024-11-28 04:14:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:14:05,057 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2024-11-28 04:14:05,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 2.3857142857142857) internal successors, (167), 71 states have internal predecessors, (167), 0 states have call successors, (0), 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-28 04:14:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2024-11-28 04:14:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-28 04:14:05,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:14:05,057 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-28 04:14:05,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 04:14:05,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:14:05,262 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:14:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:14:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 81380261, now seen corresponding path program 1 times [2024-11-28 04:14:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:14:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180462034] [2024-11-28 04:14:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:14:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:14:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:14:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:14:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:14:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180462034] [2024-11-28 04:14:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180462034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:14:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914274577] [2024-11-28 04:14:07,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:14:07,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:14:07,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:14:07,358 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:14:07,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:14:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:14:07,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-28 04:14:07,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:14:07,930 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:14:07,930 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-28 04:14:08,138 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-28 04:14:08,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:08,529 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-28 04:14:08,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:14:08,848 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-28 04:14:09,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:09,061 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-28 04:14:09,218 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-28 04:14:09,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:14:09,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2186) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) is different from false [2024-11-28 04:14:09,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2186) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-28 04:14:09,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 (Array Int Int))) (not (= (select (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_2186) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-28 04:14:09,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2185 Int) (v_ArrVal_2186 (Array Int Int))) (not (= (select (select (let ((.cse0 (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_2185)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2186)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-28 04:14:09,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2185 Int) (v_ArrVal_2186 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2185)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2186)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2024-11-28 04:14:10,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:10,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:10,098 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 2 case distinctions, treesize of input 24 treesize of output 30 [2024-11-28 04:14:10,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:10,107 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 35 treesize of output 33 [2024-11-28 04:14:10,111 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 20 treesize of output 18 [2024-11-28 04:14:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2024-11-28 04:14:10,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914274577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:14:10,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:14:10,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 25] total 64 [2024-11-28 04:14:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47956961] [2024-11-28 04:14:10,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:14:10,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-28 04:14:10,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:14:10,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 04:14:10,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3167, Unknown=45, NotChecked=590, Total=4032 [2024-11-28 04:14:10,363 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 64 states, 64 states have (on average 2.40625) internal successors, (154), 64 states have internal predecessors, (154), 0 states have call successors, (0), 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-28 04:14:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:14:13,273 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2024-11-28 04:14:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 04:14:13,273 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.40625) internal successors, (154), 64 states have internal predecessors, (154), 0 states have call successors, (0), 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-28 04:14:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:14:13,274 INFO L225 Difference]: With dead ends: 89 [2024-11-28 04:14:13,274 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 04:14:13,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=492, Invalid=6124, Unknown=46, NotChecked=820, Total=7482 [2024-11-28 04:14:13,275 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 92 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:14:13,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 932 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1779 Invalid, 0 Unknown, 343 Unchecked, 1.3s Time] [2024-11-28 04:14:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 04:14:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-28 04:14:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 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-28 04:14:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2024-11-28 04:14:13,281 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 66 [2024-11-28 04:14:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:14:13,281 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2024-11-28 04:14:13,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.40625) internal successors, (154), 64 states have internal predecessors, (154), 0 states have call successors, (0), 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-28 04:14:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2024-11-28 04:14:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:14:13,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:14:13,282 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-28 04:14:13,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 04:14:13,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:14:13,483 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:14:13,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:14:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash 894767194, now seen corresponding path program 1 times [2024-11-28 04:14:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:14:13,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068115754] [2024-11-28 04:14:13,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:14:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:14:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:14:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:14:15,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:14:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068115754] [2024-11-28 04:14:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068115754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:14:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597178359] [2024-11-28 04:14:15,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:14:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:14:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:14:15,729 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:14:15,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 04:14:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:14:16,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-28 04:14:16,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:14:16,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:14:16,290 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-28 04:14:16,487 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-28 04:14:16,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:16,857 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-28 04:14:17,105 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:14:17,106 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-28 04:14:17,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:17,339 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-28 04:14:17,533 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-28 04:14:17,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:14:18,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2296 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (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)) v_ArrVal_2296) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-28 04:14:18,228 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2295 Int) (v_ArrVal_2296 (Array Int Int))) (< (select (select (let ((.cse0 (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_2295)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2296)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-28 04:14:18,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2295 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int) (v_ArrVal_2296 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2295)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2296)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-28 04:14:18,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2295 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int) (v_ArrVal_2296 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2295)) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2296)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-28 04:14:18,615 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:18,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:18,622 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 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-28 04:14:18,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:18,630 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 32 treesize of output 30 [2024-11-28 04:14:18,640 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 5 [2024-11-28 04:14:18,864 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:14:18,865 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-28 04:14:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 14 refuted. 2 times theorem prover too weak. 11 trivial. 6 not checked. [2024-11-28 04:14:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597178359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:14:18,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:14:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23, 24] total 64 [2024-11-28 04:14:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407112476] [2024-11-28 04:14:18,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:14:18,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-28 04:14:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:14:18,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-28 04:14:18,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3327, Unknown=106, NotChecked=484, Total=4160 [2024-11-28 04:14:18,940 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 65 states, 64 states have (on average 2.4375) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 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-28 04:14:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:14:22,082 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-11-28 04:14:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 04:14:22,082 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.4375) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 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-28 04:14:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:14:22,083 INFO L225 Difference]: With dead ends: 88 [2024-11-28 04:14:22,083 INFO L226 Difference]: Without dead ends: 88 [2024-11-28 04:14:22,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=514, Invalid=6366, Unknown=108, NotChecked=668, Total=7656 [2024-11-28 04:14:22,084 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:14:22,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 954 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2157 Invalid, 0 Unknown, 286 Unchecked, 1.5s Time] [2024-11-28 04:14:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-28 04:14:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-28 04:14:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 80 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-28 04:14:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2024-11-28 04:14:22,087 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 68 [2024-11-28 04:14:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:14:22,088 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2024-11-28 04:14:22,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.4375) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 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-28 04:14:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2024-11-28 04:14:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 04:14:22,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:14:22,089 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-28 04:14:22,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 04:14:22,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 04:14:22,289 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:14:22,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:14:22,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1442598927, now seen corresponding path program 2 times [2024-11-28 04:14:22,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:14:22,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525294714] [2024-11-28 04:14:22,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:14:22,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:14:22,332 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:14:22,332 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:14:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:14:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:14:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525294714] [2024-11-28 04:14:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525294714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:14:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162080528] [2024-11-28 04:14:26,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:14:26,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:14:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:14:26,421 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:14:26,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 04:14:26,731 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:14:26,731 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:14:26,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-28 04:14:26,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:14:26,778 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-28 04:14:26,783 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-28 04:14:26,937 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:14:26,938 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-28 04:14:27,042 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-28 04:14:27,047 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-28 04:14:27,057 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-28 04:14:27,069 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-28 04:14:27,242 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-28 04:14:27,251 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-28 04:14:27,794 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-11-28 04:14:27,794 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 3 case distinctions, treesize of input 46 treesize of output 36 [2024-11-28 04:14:27,821 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-28 04:14:27,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2024-11-28 04:14:28,758 INFO L349 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2024-11-28 04:14:28,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 162 [2024-11-28 04:14:28,951 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2024-11-28 04:14:28,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 129 [2024-11-28 04:16:06,992 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-28 04:16:06,992 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 57 treesize of output 38 [2024-11-28 04:16:07,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:07,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-28 04:16:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 04:16:07,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:16:10,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int)) (or (forall ((v_ArrVal_2413 (Array Int Int))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2413)) (.cse7 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (not (= (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418)) (= (select (let ((.cse8 (select .cse4 4))) (select (store .cse6 .cse8 v_ArrVal_2418) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0)))) (not (= v_ArrVal_2413 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| (select v_ArrVal_2413 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))))) is different from false [2024-11-28 04:16:10,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int)) (or (forall ((v_ArrVal_2413 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| (select v_ArrVal_2413 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)) v_ArrVal_2413)) (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2413)) (.cse2 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (not (= (store (select .cse1 (select .cse2 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418)) (= (select (let ((.cse3 (select .cse5 4))) (select (store .cse1 .cse3 v_ArrVal_2418) (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (or (= (select (let ((.cse6 (let ((.cse9 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))))) is different from false [2024-11-28 04:16:10,129 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int)) (or (forall ((v_ArrVal_2413 (Array Int Int))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2413)) (.cse1 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (not (= (store (select .cse0 (select .cse1 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418)) (= (select (let ((.cse2 (select .cse4 4))) (select (store .cse0 .cse2 v_ArrVal_2418) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0)))) (not (= v_ArrVal_2413 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| (select v_ArrVal_2413 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (let ((.cse6 (let ((.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))))) is different from false [2024-11-28 04:16:10,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int)) (or (forall ((v_ArrVal_2413 (Array Int Int))) (or (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| (select v_ArrVal_2413 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)) v_ArrVal_2413)) (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2413)) (.cse7 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (not (= v_ArrVal_2418 (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)))) (= (select (let ((.cse8 (select .cse4 4))) (select (store .cse6 .cse8 v_ArrVal_2418) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))))) is different from false [2024-11-28 04:16:10,253 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|) (forall ((v_ArrVal_2413 (Array Int Int))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2413)) (.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (let ((.cse7 (select .cse4 4))) (select (store .cse6 .cse7 v_ArrVal_2418) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= v_ArrVal_2418 (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|))))))) (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| (select v_ArrVal_2413 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)) v_ArrVal_2413))))))))) is different from false [2024-11-28 04:16:10,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int)) (or (forall ((v_ArrVal_2413 (Array Int Int))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2413)) (.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (let ((.cse1 (select .cse4 4))) (select (store .cse0 .cse1 v_ArrVal_2418) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (not (= (store (select .cse0 (select .cse3 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418))))) (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| (select v_ArrVal_2413 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)) v_ArrVal_2413)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (let ((.cse6 (let ((.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)))))) is different from false [2024-11-28 04:16:10,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int)) (or (forall ((v_ArrVal_2413 (Array Int Int))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413)) (.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (let ((.cse1 (select .cse4 4))) (select (store .cse0 .cse1 v_ArrVal_2418) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse0 (select .cse3 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418))))) (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| (select v_ArrVal_2413 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)) v_ArrVal_2413)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_97| Int) (v_ArrVal_2414 Int) (v_ArrVal_2417 Int)) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (let ((.cse6 (let ((.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97| v_ArrVal_2414))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_97|)))))) is different from false [2024-11-28 04:16:10,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:16:10,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:16:10,421 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-28 04:16:10,421 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 120 [2024-11-28 04:16:10,431 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-28 04:16:10,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:16:10,634 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:16:10,706 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-28 04:16:10,706 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 142 [2024-11-28 04:16:10,746 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-28 04:16:10,747 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 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-28 04:16:11,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse36 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse4 (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2413 (Array Int Int))) (let ((.cse52 (select v_ArrVal_2413 4))) (or (not (= .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int)) (or (< .cse52 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (forall ((v_ArrVal_2418 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413))) (or (forall ((v_ArrVal_2417 Int)) (= (select (select (store .cse53 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2418) (select (select (let ((.cse54 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (store .cse54 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse54 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not (= (store (select .cse53 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418)))))))))) (not (= (select v_arrayElimArr_8 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (.cse0 (not .cse36)) (.cse17 (< 0 .cse5))) (and (or .cse0 (and (forall ((v_arrayElimArr_8 (Array Int Int))) (or (not (= (select v_arrayElimArr_8 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2413 (Array Int Int)) (v_arrayElimCell_144 Int)) (let ((.cse1 (select v_ArrVal_2413 4))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int)) (or (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (forall ((v_ArrVal_2418 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413))) (or (forall ((v_ArrVal_2417 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2418) (select (select (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse2 v_arrayElimCell_144 v_ArrVal_2418) (select (select (store .cse3 v_arrayElimCell_144 (store (select .cse3 v_arrayElimCell_144) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) (not (= (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418))))))) (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) .cse4)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2417 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (or (= (select (let ((.cse6 (let ((.cse8 (select v_arrayElimArr_7 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse9 (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2417 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (or (= (select (let ((.cse10 (let ((.cse12 (select v_arrayElimArr_7 4))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse13 (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse16 (select v_arrayElimArr_7 4))) (store .cse15 .cse16 (store (select .cse15 .cse16) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))))) .cse17) (or (and (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_8 4))) (or (forall ((v_ArrVal_2413 (Array Int Int))) (let ((.cse18 (select v_ArrVal_2413 4))) (or (not (= .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int)) (or (< .cse18 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (forall ((v_ArrVal_2418 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413))) (or (forall ((v_ArrVal_2417 Int)) (= (select (select (store .cse19 .cse20 v_ArrVal_2418) (select (select (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (store .cse21 .cse20 (store (select .cse21 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)) v_ArrVal_2418)))))))))) (not (= .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) .cse4) .cse0) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2417 Int)) (or (= (select (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse24 (select v_arrayElimArr_7 4))) (store .cse23 .cse24 (store (select .cse23 .cse24) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_7 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2417 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (or (= (select (let ((.cse25 (let ((.cse27 (select v_arrayElimArr_7 4))) (store .cse26 .cse27 (store (select .cse26 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse28 (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2417 Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (or (= (select (let ((.cse29 (let ((.cse31 (select v_arrayElimArr_7 4))) (store .cse30 .cse31 (store (select .cse30 .cse31) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse32 (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (let ((.cse33 (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse35 (select v_arrayElimArr_7 4))) (store .cse34 .cse35 (store (select .cse34 .cse35) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse17)) .cse36) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2417 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse39 (select v_arrayElimArr_7 4))) (store .cse38 .cse39 (store (select .cse38 .cse39) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_7 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse36) (or (and (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2413 (Array Int Int)) (v_ArrVal_2417 Int)) (let ((.cse40 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413)) (.cse41 (select v_arrayElimArr_8 4))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (select (store .cse40 .cse41 v_ArrVal_2418) (select (select (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (store .cse42 .cse41 (store (select .cse42 .cse41) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2418 (store (select .cse40 .cse41) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|))))))) .cse17) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2413 (Array Int Int)) (v_ArrVal_2417 Int)) (let ((.cse45 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse43 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413)) (.cse44 (select v_arrayElimArr_8 4))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (select (store .cse43 .cse44 v_ArrVal_2418) (select (select (store .cse45 .cse44 (store (select .cse45 .cse44) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2418) (select (select (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2418 (store (select .cse43 .cse44) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)))) (not (= (select v_ArrVal_2413 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (not (= (select v_arrayElimArr_8 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_ArrVal_2413 (Array Int Int)) (v_ArrVal_2417 Int)) (let ((.cse46 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413)) (.cse47 (select v_arrayElimArr_8 4))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (select (store .cse46 .cse47 v_ArrVal_2418) (select (select (let ((.cse48 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (store .cse48 .cse47 (store (select .cse48 .cse47) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2418 (store (select .cse46 .cse47) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|)))) (not (= (select v_ArrVal_2413 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (not (= (select v_arrayElimArr_8 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_94| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2413 (Array Int Int)) (v_ArrVal_2417 Int)) (let ((.cse51 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse49 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2413)) (.cse50 (select v_arrayElimArr_8 4))) (or (< (select v_ArrVal_2413 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|) (= (select (select (store .cse49 .cse50 v_ArrVal_2418) (select (select (store .cse51 .cse50 (store (select .cse51 .cse50) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2418) (select (select (store .cse51 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse51 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| v_ArrVal_2417)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2418 (store (select .cse49 .cse50) |v_ULTIMATE.start_sll_update_at_~head#1.offset_94| (select v_ArrVal_2418 |v_ULTIMATE.start_sll_update_at_~head#1.offset_94|))))))) .cse17)) .cse36)))) is different from false [2024-11-28 04:16:21,835 INFO L349 Elim1Store]: treesize reduction 142, result has 61.1 percent of original size [2024-11-28 04:16:21,836 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 867 treesize of output 976 [2024-11-28 04:16:21,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:21,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 1155 treesize of output 906 [2024-11-28 04:16:22,443 INFO L349 Elim1Store]: treesize reduction 69, result has 72.7 percent of original size [2024-11-28 04:16:22,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 18924 treesize of output 18366 [2024-11-28 04:16:22,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:22,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1341 treesize of output 1490 [2024-11-28 04:16:22,841 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 1586 treesize of output 1490 [2024-11-28 04:16:23,001 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-28 04:16:23,002 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 1131 treesize of output 1132 [2024-11-28 04:16:23,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:23,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1119 treesize of output 1189 [2024-11-28 04:16:23,451 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 1371 treesize of output 1331 [2024-11-28 04:16:23,718 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 1306 treesize of output 1256 [2024-11-28 04:16:23,950 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-28 04:16:23,951 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 1038 treesize of output 1047 [2024-11-28 04:16:24,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1511 treesize of output 1451 [2024-11-28 04:16:24,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:24,296 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 1176 treesize of output 1166 [2024-11-28 04:16:24,558 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-28 04:16:24,558 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 1038 treesize of output 1047 [2024-11-28 04:16:31,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:16:31,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:31,656 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 20 treesize of output 24 [2024-11-28 04:16:31,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:31,688 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 20 treesize of output 24 [2024-11-28 04:16:31,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:31,722 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 20 treesize of output 24 [2024-11-28 04:16:32,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:32,033 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-28 04:16:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 1 times theorem prover too weak. 11 trivial. 12 not checked. [2024-11-28 04:16:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162080528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:16:32,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:16:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32, 31] total 79 [2024-11-28 04:16:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260089715] [2024-11-28 04:16:32,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:16:32,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-11-28 04:16:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:32,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-28 04:16:32,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=4742, Unknown=28, NotChecked=1160, Total=6162 [2024-11-28 04:16:32,084 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 79 states, 79 states have (on average 2.1392405063291138) internal successors, (169), 79 states have internal predecessors, (169), 0 states have call successors, (0), 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-28 04:16:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:49,181 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2024-11-28 04:16:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 04:16:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.1392405063291138) internal successors, (169), 79 states have internal predecessors, (169), 0 states have call successors, (0), 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-28 04:16:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:49,182 INFO L225 Difference]: With dead ends: 142 [2024-11-28 04:16:49,182 INFO L226 Difference]: Without dead ends: 142 [2024-11-28 04:16:49,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=494, Invalid=8252, Unknown=28, NotChecked=1528, Total=10302 [2024-11-28 04:16:49,183 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 624 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:49,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1581 Invalid, 3253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2585 Invalid, 0 Unknown, 624 Unchecked, 6.3s Time] [2024-11-28 04:16:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-28 04:16:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-28 04:16:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0522388059701493) internal successors, (141), 138 states have internal predecessors, (141), 0 states have call successors, (0), 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-28 04:16:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2024-11-28 04:16:49,192 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 71 [2024-11-28 04:16:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:49,192 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2024-11-28 04:16:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.1392405063291138) internal successors, (169), 79 states have internal predecessors, (169), 0 states have call successors, (0), 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-28 04:16:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2024-11-28 04:16:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:16:49,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:49,195 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-28 04:16:49,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 04:16:49,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:16:49,395 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:16:49,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1770896221, now seen corresponding path program 2 times [2024-11-28 04:16:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444103100] [2024-11-28 04:16:49,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:16:49,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:49,425 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:16:49,425 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:16:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:16:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444103100] [2024-11-28 04:16:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444103100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:16:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920879938] [2024-11-28 04:16:52,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:16:52,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:16:52,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:16:52,246 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:16:52,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 04:16:52,560 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:16:52,560 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:16:52,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-28 04:16:52,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:16:53,207 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-28 04:16:53,812 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-28 04:16:53,812 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 52 treesize of output 36 [2024-11-28 04:16:54,770 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-28 04:16:54,770 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 87 treesize of output 88 [2024-11-28 04:16:54,825 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:16:54,826 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 68 treesize of output 62 [2024-11-28 04:16:57,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:16:57,346 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 135 treesize of output 125 [2024-11-28 04:16:58,818 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_30| Int) (|v_ULTIMATE.start_sll_destroy_~head#1.base_29| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_30|) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_30| 1) |v_ULTIMATE.start_sll_destroy_~head#1.base_29|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_29| 0) |v_ULTIMATE.start_sll_destroy_~head#1.base_30| 0)))) is different from true [2024-11-28 04:16:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2024-11-28 04:16:58,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:00,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_104| Int) (v_ArrVal_2531 Int) (v_ArrVal_2533 (Array Int Int))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104| v_ArrVal_2531)) (select .cse0 4) v_ArrVal_2533)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-28 04:17:00,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_104| Int) (v_ArrVal_2531 Int) (v_ArrVal_2533 (Array Int Int))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104|) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104| v_ArrVal_2531)) (select .cse0 4) v_ArrVal_2533)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0)))) is different from false [2024-11-28 04:17:00,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_104| Int) (v_ArrVal_2531 Int) (v_ArrVal_2533 (Array Int Int))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104| v_ArrVal_2531)) (select .cse0 4) v_ArrVal_2533)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-28 04:17:00,319 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_104| Int) (v_ArrVal_2531 Int) (v_ArrVal_2533 (Array Int Int))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_104| v_ArrVal_2531)) (select .cse0 4) v_ArrVal_2533)) |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-28 04:17:00,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:00,331 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 42 treesize of output 42 [2024-11-28 04:17:00,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:17:00,379 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-11-28 04:17:00,379 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 2 case distinctions, treesize of input 70 treesize of output 80 [2024-11-28 04:17:00,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:00,391 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 124 treesize of output 114 [2024-11-28 04:17:00,397 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-28 04:19:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2024-11-28 04:19:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920879938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:19:18,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:19:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 26] total 80 [2024-11-28 04:19:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323061426] [2024-11-28 04:19:18,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:19:18,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-11-28 04:19:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:19:18,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-11-28 04:19:18,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=5388, Unknown=39, NotChecked=760, Total=6480 [2024-11-28 04:19:18,732 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand has 81 states, 80 states have (on average 2.35) internal successors, (188), 81 states have internal predecessors, (188), 0 states have call successors, (0), 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-28 04:19:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:19:31,154 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2024-11-28 04:19:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 04:19:31,154 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 2.35) internal successors, (188), 81 states have internal predecessors, (188), 0 states have call successors, (0), 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-28 04:19:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:19:31,155 INFO L225 Difference]: With dead ends: 142 [2024-11-28 04:19:31,155 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 04:19:31,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 152.0s TimeCoverageRelationStatistics Valid=544, Invalid=8942, Unknown=40, NotChecked=980, Total=10506 [2024-11-28 04:19:31,156 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 66 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:19:31,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1199 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2503 Invalid, 0 Unknown, 438 Unchecked, 4.1s Time] [2024-11-28 04:19:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 04:19:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-28 04:19:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 89 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:19:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2024-11-28 04:19:31,159 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 72 [2024-11-28 04:19:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:19:31,159 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2024-11-28 04:19:31,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 2.35) internal successors, (188), 81 states have internal predecessors, (188), 0 states have call successors, (0), 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-28 04:19:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2024-11-28 04:19:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-28 04:19:31,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:19:31,160 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-28 04:19:31,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 04:19:31,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-28 04:19:31,365 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-28 04:19:31,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:19:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2127038017, now seen corresponding path program 3 times [2024-11-28 04:19:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:19:31,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731149077] [2024-11-28 04:19:31,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:19:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:19:31,413 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:19:31,414 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:19:31,528 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-28 04:19:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:19:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731149077] [2024-11-28 04:19:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731149077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:19:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709875985] [2024-11-28 04:19:31,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:19:31,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:19:31,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:19:31,532 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:19:31,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 04:19:32,392 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:19:32,392 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:19:32,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:19:32,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:19:32,444 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-28 04:19:32,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:19:32,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709875985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:19:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:19:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-28 04:19:32,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916036468] [2024-11-28 04:19:32,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:19:32,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:19:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:19:32,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:19:32,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:19:32,447 INFO L87 Difference]: Start difference. First operand 90 states and 91 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-28 04:19:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:19:32,459 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-11-28 04:19:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:19:32,459 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-28 04:19:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:19:32,460 INFO L225 Difference]: With dead ends: 21 [2024-11-28 04:19:32,460 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 04:19:32,460 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-28 04:19:32,460 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 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-28 04:19:32,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:19:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 04:19:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 04:19:32,461 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-28 04:19:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 04:19:32,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-11-28 04:19:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:19:32,461 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 04:19:32,462 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-28 04:19:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 04:19:32,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 04:19:32,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-28 04:19:32,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-28 04:19:32,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-28 04:19:32,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-28 04:19:32,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-28 04:19:32,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-28 04:19:32,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-28 04:19:32,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-28 04:19:32,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-28 04:19:32,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-28 04:19:32,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-28 04:19:32,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-28 04:19:32,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2024-11-28 04:19:32,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-28 04:19:32,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 04:19:32,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:19:32,674 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, 1] [2024-11-28 04:19:32,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:19:32,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:19:32 BoogieIcfgContainer [2024-11-28 04:19:32,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:19:32,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:19:32,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:19:32,679 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:19:32,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:12:41" (3/4) ... [2024-11-28 04:19:32,681 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 04:19:32,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-28 04:19:32,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-28 04:19:32,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 04:19:32,690 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 04:19:32,799 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:19:32,799 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:19:32,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:19:32,802 INFO L158 Benchmark]: Toolchain (without parser) took 412411.89ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 116.6MB in the beginning and 598.6MB in the end (delta: -482.0MB). Peak memory consumption was 243.9MB. Max. memory is 16.1GB. [2024-11-28 04:19:32,802 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 74.0MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:19:32,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.56ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 99.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:19:32,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.94ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:19:32,803 INFO L158 Benchmark]: Boogie Preprocessor took 75.53ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:19:32,803 INFO L158 Benchmark]: RCFGBuilder took 766.77ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 76.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:19:32,804 INFO L158 Benchmark]: TraceAbstraction took 410792.57ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 76.4MB in the beginning and 602.7MB in the end (delta: -526.3MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. [2024-11-28 04:19:32,804 INFO L158 Benchmark]: Witness Printer took 120.67ms. Allocated memory is still 872.4MB. Free memory was 602.7MB in the beginning and 598.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:19:32,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 74.0MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.56ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 99.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.94ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.53ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 766.77ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 76.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 410792.57ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 76.4MB in the beginning and 602.7MB in the end (delta: -526.3MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. * Witness Printer took 120.67ms. Allocated memory is still 872.4MB. Free memory was 602.7MB in the beginning and 598.6MB in the end (delta: 4.1MB). 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: 410.7s, OverallIterations: 36, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 63.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2223 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2223 mSDsluCounter, 17356 SdHoareTripleChecker+Invalid, 23.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3516 IncrementalHoareTripleChecker+Unchecked, 15835 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24282 IncrementalHoareTripleChecker+Invalid, 28110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 1521 mSDtfsCounter, 24282 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2776 GetRequests, 1578 SyntacticMatches, 52 SemanticMatches, 1146 ConstructedPredicates, 49 IntricatePredicates, 1 DeprecatedPredicates, 14932 ImplicationChecksByTransitivity, 236.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=34, InterpolantAutomatonStates: 512, 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, 36 MinimizatonAttempts, 291 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 335.1s InterpolantComputationTime, 2595 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 3446 ConstructedInterpolants, 290 QuantifiedInterpolants, 154382 SizeOfPredicates, 96 NumberOfNonLiveVariables, 7341 ConjunctsInSsa, 1015 ConjunctsInUnsatCore, 75 InterpolantComputations, 18 PerfectInterpolantSequences, 998/1737 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-28 04:19:33,025 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-28 04:19:33,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f697b1f6-3974-48d0-ae89-46a420d1476d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE