./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.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_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/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_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/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_3ab0122e-a5e1-49cf-b066-d7aaafff802d/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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:20:20,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:20:20,604 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:20:20,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:20:20,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:20:20,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:20:20,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:20:20,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:20:20,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:20:20,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:20:20,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:20:20,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:20:20,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:20:20,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:20:20,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:20:20,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:20:20,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:20:20,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:20:20,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:20:20,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:20:20,637 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:20:20,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:20:20,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:20,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:20,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:20,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:20:20,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:20:20,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:20:20,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:20:20,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:20:20,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:20:20,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:20:20,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:20:20,640 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_3ab0122e-a5e1-49cf-b066-d7aaafff802d/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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2024-11-28 03:20:20,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:20:20,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:20:20,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:20:20,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:20:20,914 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:20:20,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2024-11-28 03:20:23,941 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/data/9482e5b15/f6713f80a7b54518956f062b4a9d0af9/FLAG1e178d87f [2024-11-28 03:20:24,320 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:20:24,322 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2024-11-28 03:20:24,343 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/data/9482e5b15/f6713f80a7b54518956f062b4a9d0af9/FLAG1e178d87f [2024-11-28 03:20:24,366 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/data/9482e5b15/f6713f80a7b54518956f062b4a9d0af9 [2024-11-28 03:20:24,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:20:24,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:20:24,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:20:24,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:20:24,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:20:24,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ece4ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24, skipping insertion in model container [2024-11-28 03:20:24,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:20:24,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:20:24,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:20:24,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:20:24,896 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:20:24,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24 WrapperNode [2024-11-28 03:20:24,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:20:24,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:20:24,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:20:24,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:20:24,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,948 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2024-11-28 03:20:24,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:20:24,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:20:24,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:20:24,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:20:24,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,992 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-28 03:20:24,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:24,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:25,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:25,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:25,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:25,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:25,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:25,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:20:25,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:20:25,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:20:25,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:20:25,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (1/1) ... [2024-11-28 03:20:25,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:25,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:25,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:20:25,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:20:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:20:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:20:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:20:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:20:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:20:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:20:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:20:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:20:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:20:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:20:25,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:20:25,251 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:20:25,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:20:25,700 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-28 03:20:25,700 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:20:25,718 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:20:25,718 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:20:25,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:25 BoogieIcfgContainer [2024-11-28 03:20:25,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:20:25,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:20:25,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:20:25,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:20:25,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:20:24" (1/3) ... [2024-11-28 03:20:25,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61eaf98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:25, skipping insertion in model container [2024-11-28 03:20:25,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:24" (2/3) ... [2024-11-28 03:20:25,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61eaf98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:25, skipping insertion in model container [2024-11-28 03:20:25,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:25" (3/3) ... [2024-11-28 03:20:25,734 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2024-11-28 03:20:25,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:20:25,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_extends_pointer.i that has 1 procedures, 61 locations, 1 initial locations, 2 loop locations, and 27 error locations. [2024-11-28 03:20:25,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:20:25,850 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;@54dcfbd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:20:25,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-28 03:20:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 33 states have (on average 2.0) 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 03:20:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:20:25,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:25,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:20:25,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:25,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 03:20:25,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:25,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336992703] [2024-11-28 03:20:25,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:25,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:26,120 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 03:20:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336992703] [2024-11-28 03:20:26,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336992703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:26,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:26,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:20:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836934931] [2024-11-28 03:20:26,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:26,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:26,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:26,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:26,161 INFO L87 Difference]: Start difference. First operand has 61 states, 33 states have (on average 2.0) 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:26,330 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-28 03:20:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 03:20:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:26,341 INFO L225 Difference]: With dead ends: 58 [2024-11-28 03:20:26,341 INFO L226 Difference]: Without dead ends: 56 [2024-11-28 03:20:26,343 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 03:20:26,347 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:26,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-28 03:20:26,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-28 03:20:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 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 03:20:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-11-28 03:20:26,397 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 3 [2024-11-28 03:20:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:26,397 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-28 03:20:26,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-28 03:20:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:20:26,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:26,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:20:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:20:26,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:26,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 03:20:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225841733] [2024-11-28 03:20:26,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:26,548 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 03:20:26,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:26,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225841733] [2024-11-28 03:20:26,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225841733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:26,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:26,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:20:26,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666199622] [2024-11-28 03:20:26,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:26,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:26,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:26,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:26,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:26,552 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:26,659 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-28 03:20:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:26,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 03:20:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:26,661 INFO L225 Difference]: With dead ends: 51 [2024-11-28 03:20:26,663 INFO L226 Difference]: Without dead ends: 51 [2024-11-28 03:20:26,663 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 03:20:26,664 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:26,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-28 03:20:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-28 03:20:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-28 03:20:26,676 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 3 [2024-11-28 03:20:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:26,678 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-28 03:20:26,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-28 03:20:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:20:26,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:26,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:26,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:20:26,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:26,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 232100623, now seen corresponding path program 1 times [2024-11-28 03:20:26,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:26,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932566269] [2024-11-28 03:20:26,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:27,105 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 03:20:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932566269] [2024-11-28 03:20:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932566269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:27,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721977596] [2024-11-28 03:20:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:20:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:27,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:20:27,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:20:27,107 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 03:20:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:27,296 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-28 03:20:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:20:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-28 03:20:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:27,298 INFO L225 Difference]: With dead ends: 56 [2024-11-28 03:20:27,298 INFO L226 Difference]: Without dead ends: 56 [2024-11-28 03:20:27,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:20:27,300 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:27,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 36 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:20:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-28 03:20:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-11-28 03:20:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.55) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-28 03:20:27,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 11 [2024-11-28 03:20:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:27,313 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-28 03:20:27,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 03:20:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-28 03:20:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:20:27,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:27,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:20:27,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:27,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 232100624, now seen corresponding path program 1 times [2024-11-28 03:20:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946098002] [2024-11-28 03:20:27,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:27,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 03:20:27,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:27,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946098002] [2024-11-28 03:20:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946098002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:27,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:27,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:27,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342545889] [2024-11-28 03:20:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:27,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:27,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:27,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:27,727 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 03:20:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:27,911 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2024-11-28 03:20:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:27,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-28 03:20:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:27,912 INFO L225 Difference]: With dead ends: 75 [2024-11-28 03:20:27,913 INFO L226 Difference]: Without dead ends: 75 [2024-11-28 03:20:27,913 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 03:20:27,914 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:27,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 63 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:20:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-28 03:20:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-28 03:20:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2024-11-28 03:20:27,927 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 11 [2024-11-28 03:20:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:27,927 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-11-28 03:20:27,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 03:20:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2024-11-28 03:20:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:20:27,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:27,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:27,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:20:27,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 232192042, now seen corresponding path program 1 times [2024-11-28 03:20:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48440530] [2024-11-28 03:20:27,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:28,025 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 03:20:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48440530] [2024-11-28 03:20:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48440530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:28,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:28,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530437359] [2024-11-28 03:20:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:28,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:28,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:28,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:28,028 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 03:20:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:28,164 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2024-11-28 03:20:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:28,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-28 03:20:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:28,168 INFO L225 Difference]: With dead ends: 88 [2024-11-28 03:20:28,169 INFO L226 Difference]: Without dead ends: 88 [2024-11-28 03:20:28,169 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 03:20:28,172 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:28,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-28 03:20:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2024-11-28 03:20:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2024-11-28 03:20:28,182 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 11 [2024-11-28 03:20:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:28,182 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2024-11-28 03:20:28,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 03:20:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2024-11-28 03:20:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 03:20:28,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:28,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:20:28,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:28,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash -387686669, now seen corresponding path program 1 times [2024-11-28 03:20:28,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:28,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269823060] [2024-11-28 03:20:28,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:28,444 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 03:20:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:28,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269823060] [2024-11-28 03:20:28,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269823060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:28,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:28,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239215334] [2024-11-28 03:20:28,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:28,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:28,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:28,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:28,450 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:28,573 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-11-28 03:20:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 03:20:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:28,577 INFO L225 Difference]: With dead ends: 71 [2024-11-28 03:20:28,577 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 03:20:28,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:28,578 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:28,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 63 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 03:20:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-28 03:20:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 70 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 03:20:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-11-28 03:20:28,590 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 14 [2024-11-28 03:20:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:28,590 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-11-28 03:20:28,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-11-28 03:20:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:20:28,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:28,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:28,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:20:28,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash 8381, now seen corresponding path program 1 times [2024-11-28 03:20:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:28,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544595923] [2024-11-28 03:20:28,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:28,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:29,080 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 03:20:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544595923] [2024-11-28 03:20:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544595923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:29,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:29,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:20:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616138142] [2024-11-28 03:20:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:20:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:29,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:20:29,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:20:29,083 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:29,276 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-28 03:20:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:20:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 03:20:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:29,279 INFO L225 Difference]: With dead ends: 66 [2024-11-28 03:20:29,279 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 03:20:29,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:20:29,281 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:29,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 109 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 03:20:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 03:20:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-28 03:20:29,285 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2024-11-28 03:20:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:29,285 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-28 03:20:29,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-11-28 03:20:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:20:29,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:29,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:29,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:20:29,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:29,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash 19366, now seen corresponding path program 1 times [2024-11-28 03:20:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017349389] [2024-11-28 03:20:29,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:29,363 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 03:20:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017349389] [2024-11-28 03:20:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017349389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583484089] [2024-11-28 03:20:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:29,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:29,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:29,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:29,365 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:29,472 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-28 03:20:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 03:20:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:29,473 INFO L225 Difference]: With dead ends: 80 [2024-11-28 03:20:29,474 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 03:20:29,474 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 03:20:29,474 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:29,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 03:20:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-28 03:20:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 74 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2024-11-28 03:20:29,479 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 16 [2024-11-28 03:20:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:29,480 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2024-11-28 03:20:29,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2024-11-28 03:20:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:20:29,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:29,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:29,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:20:29,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 708516233, now seen corresponding path program 1 times [2024-11-28 03:20:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381507952] [2024-11-28 03:20:29,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381507952] [2024-11-28 03:20:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381507952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799530970] [2024-11-28 03:20:29,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:29,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:29,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:29,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:29,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:20:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:29,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:20:29,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:29,984 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 03:20:29,993 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 03:20:30,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 19 treesize of output 18 [2024-11-28 03:20:30,055 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 19 treesize of output 18 [2024-11-28 03:20:30,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:30,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 03:20:30,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 03:20:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:30,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:30,835 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 10 treesize of output 8 [2024-11-28 03:20:30,842 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 14 treesize of output 12 [2024-11-28 03:20:30,855 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 10 treesize of output 8 [2024-11-28 03:20:30,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799530970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:30,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 14 [2024-11-28 03:20:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195744622] [2024-11-28 03:20:30,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:30,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:20:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:30,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:20:30,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:20:30,880 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 03:20:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:31,326 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2024-11-28 03:20:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:20:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 20 [2024-11-28 03:20:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:31,327 INFO L225 Difference]: With dead ends: 89 [2024-11-28 03:20:31,327 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 03:20:31,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:20:31,328 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:31,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 180 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:20:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 03:20:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-28 03:20:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2024-11-28 03:20:31,339 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 20 [2024-11-28 03:20:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:31,339 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2024-11-28 03:20:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 03:20:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2024-11-28 03:20:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:20:31,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:31,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:31,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:20:31,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:31,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash 708519179, now seen corresponding path program 1 times [2024-11-28 03:20:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:31,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817915346] [2024-11-28 03:20:31,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:31,664 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 03:20:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817915346] [2024-11-28 03:20:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817915346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967088151] [2024-11-28 03:20:31,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:31,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:31,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:31,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:31,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:20:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:31,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 03:20:31,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:31,799 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 13 treesize of output 9 [2024-11-28 03:20:31,824 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 03:20:31,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:31,860 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 03:20:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967088151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:31,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:31,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 03:20:31,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106186456] [2024-11-28 03:20:31,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:31,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:20:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:31,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:20:31,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:20:31,862 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 03:20:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:31,979 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2024-11-28 03:20:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:20:31,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 20 [2024-11-28 03:20:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:31,980 INFO L225 Difference]: With dead ends: 90 [2024-11-28 03:20:31,980 INFO L226 Difference]: Without dead ends: 78 [2024-11-28 03:20:31,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:20:31,981 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:31,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-28 03:20:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-11-28 03:20:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.4375) internal successors, (92), 76 states have internal predecessors, (92), 0 states have call successors, (0), 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 03:20:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2024-11-28 03:20:31,985 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 20 [2024-11-28 03:20:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:31,985 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2024-11-28 03:20:31,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 03:20:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2024-11-28 03:20:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 03:20:31,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:31,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:31,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:20:32,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 03:20:32,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:32,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2035769377, now seen corresponding path program 1 times [2024-11-28 03:20:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685586803] [2024-11-28 03:20:32,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:32,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:32,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685586803] [2024-11-28 03:20:32,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685586803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:32,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704568871] [2024-11-28 03:20:32,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:32,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:32,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:32,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:32,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:20:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:32,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 03:20:32,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:32,639 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 03:20:32,674 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 03:20:32,693 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:20:32,693 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 12 treesize of output 14 [2024-11-28 03:20:32,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:32,741 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 03:20:32,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:32,751 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 03:20:32,807 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:20:32,808 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 12 treesize of output 14 [2024-11-28 03:20:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:32,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:33,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704568871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:33,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-28 03:20:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226663880] [2024-11-28 03:20:33,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:33,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:20:33,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:33,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:20:33,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:20:33,095 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 03:20:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:33,324 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2024-11-28 03:20:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:20:33,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 21 [2024-11-28 03:20:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:33,325 INFO L225 Difference]: With dead ends: 79 [2024-11-28 03:20:33,325 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 03:20:33,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:20:33,326 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 86 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:33,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:20:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 03:20:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2024-11-28 03:20:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 71 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 03:20:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-11-28 03:20:33,334 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 21 [2024-11-28 03:20:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:33,334 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-11-28 03:20:33,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 03:20:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-11-28 03:20:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:20:33,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:33,335 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:33,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:20:33,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-28 03:20:33,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:33,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1952917940, now seen corresponding path program 1 times [2024-11-28 03:20:33,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:33,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955774254] [2024-11-28 03:20:33,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:33,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:34,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955774254] [2024-11-28 03:20:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955774254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:34,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:34,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:20:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127300424] [2024-11-28 03:20:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:20:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:34,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:20:34,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:20:34,003 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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 03:20:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:34,162 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-28 03:20:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:20:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-28 03:20:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:34,163 INFO L225 Difference]: With dead ends: 78 [2024-11-28 03:20:34,163 INFO L226 Difference]: Without dead ends: 78 [2024-11-28 03:20:34,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:20:34,164 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:34,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 161 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-28 03:20:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-28 03:20:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.35) internal successors, (81), 71 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 03:20:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-28 03:20:34,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 26 [2024-11-28 03:20:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:34,172 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-28 03:20:34,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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 03:20:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-28 03:20:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 03:20:34,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:34,172 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:34,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:20:34,173 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:34,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash -410913893, now seen corresponding path program 1 times [2024-11-28 03:20:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944632024] [2024-11-28 03:20:34,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:34,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944632024] [2024-11-28 03:20:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944632024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:34,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:34,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:20:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293808319] [2024-11-28 03:20:34,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:34,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:20:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:34,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:20:34,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:20:34,607 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:34,823 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2024-11-28 03:20:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:20:34,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 03:20:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:34,825 INFO L225 Difference]: With dead ends: 77 [2024-11-28 03:20:34,825 INFO L226 Difference]: Without dead ends: 77 [2024-11-28 03:20:34,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:20:34,826 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:34,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 148 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:20:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-28 03:20:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-28 03:20:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 71 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 03:20:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-11-28 03:20:34,832 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 27 [2024-11-28 03:20:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:34,833 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-28 03:20:34,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:34,833 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-11-28 03:20:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:20:34,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:34,834 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:20:34,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 146571310, now seen corresponding path program 1 times [2024-11-28 03:20:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182082487] [2024-11-28 03:20:34,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:35,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182082487] [2024-11-28 03:20:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182082487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:35,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:35,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:20:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557983656] [2024-11-28 03:20:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:35,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:20:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:35,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:20:35,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:20:35,170 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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 03:20:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:35,334 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-28 03:20:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:20:35,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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 28 [2024-11-28 03:20:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:35,335 INFO L225 Difference]: With dead ends: 72 [2024-11-28 03:20:35,335 INFO L226 Difference]: Without dead ends: 72 [2024-11-28 03:20:35,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:20:35,336 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:35,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-28 03:20:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-28 03:20:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 71 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 03:20:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-28 03:20:35,339 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2024-11-28 03:20:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:35,339 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-28 03:20:35,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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 03:20:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-28 03:20:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 03:20:35,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:35,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:35,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:20:35,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1739925915, now seen corresponding path program 1 times [2024-11-28 03:20:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:35,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053453744] [2024-11-28 03:20:35,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053453744] [2024-11-28 03:20:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053453744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288745171] [2024-11-28 03:20:35,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:35,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:35,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:20:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:35,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 03:20:35,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:35,806 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 03:20:35,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:35,831 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 03:20:35,858 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 11 treesize of output 7 [2024-11-28 03:20:35,902 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:20:35,903 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 03:20:35,952 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 29 treesize of output 24 [2024-11-28 03:20:36,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:36,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2024-11-28 03:20:36,139 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 03:20:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:36,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:36,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:36,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-28 03:20:36,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:36,704 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 18 treesize of output 19 [2024-11-28 03:20:36,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:36,718 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 30 treesize of output 30 [2024-11-28 03:20:36,725 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 03:20:36,762 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:20:36,762 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 19 treesize of output 1 [2024-11-28 03:20:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288745171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:36,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:36,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 23 [2024-11-28 03:20:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966042255] [2024-11-28 03:20:36,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:20:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:36,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:20:36,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=482, Unknown=1, NotChecked=0, Total=552 [2024-11-28 03:20:36,862 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:38,037 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-28 03:20:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:20:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 03:20:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:38,038 INFO L225 Difference]: With dead ends: 88 [2024-11-28 03:20:38,038 INFO L226 Difference]: Without dead ends: 88 [2024-11-28 03:20:38,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=320, Invalid=1401, Unknown=1, NotChecked=0, Total=1722 [2024-11-28 03:20:38,040 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:38,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 237 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:20:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-28 03:20:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-28 03:20:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 77 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 03:20:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-11-28 03:20:38,043 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 29 [2024-11-28 03:20:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:38,043 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-11-28 03:20:38,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-11-28 03:20:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 03:20:38,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:38,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:38,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:20:38,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 03:20:38,248 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:38,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1739925916, now seen corresponding path program 1 times [2024-11-28 03:20:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660360125] [2024-11-28 03:20:38,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660360125] [2024-11-28 03:20:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660360125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284845705] [2024-11-28 03:20:38,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:38,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:38,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:20:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:38,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 03:20:38,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:38,877 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 03:20:38,882 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 03:20:38,982 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:20:38,983 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 03:20:39,000 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:39,001 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 03:20:39,044 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 11 treesize of output 7 [2024-11-28 03:20:39,051 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 11 treesize of output 7 [2024-11-28 03:20:39,112 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:20:39,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 03:20:39,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 03:20:39,180 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 29 treesize of output 24 [2024-11-28 03:20:39,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:20:39,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-28 03:20:39,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 7 treesize of output 3 [2024-11-28 03:20:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:39,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:39,784 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_49| Int) (v_ArrVal_657 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_49| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_49|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_657) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_49|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_658) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_49|))))) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_49| Int) (v_ArrVal_657 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_49| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_49|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_657) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_49|) 1))))) is different from false [2024-11-28 03:20:39,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:39,802 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 37 treesize of output 38 [2024-11-28 03:20:39,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:39,810 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 29 treesize of output 30 [2024-11-28 03:20:39,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:39,836 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 52 treesize of output 52 [2024-11-28 03:20:39,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:39,849 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 82 treesize of output 78 [2024-11-28 03:20:39,858 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 15 treesize of output 13 [2024-11-28 03:20:39,865 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 13 treesize of output 11 [2024-11-28 03:20:39,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:39,903 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 20 treesize of output 21 [2024-11-28 03:20:39,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:20:39,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:39,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-28 03:20:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284845705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:40,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2024-11-28 03:20:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894531343] [2024-11-28 03:20:40,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 03:20:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:40,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 03:20:40,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=620, Unknown=1, NotChecked=50, Total=756 [2024-11-28 03:20:40,176 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 28 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 28 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 03:20:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:41,149 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2024-11-28 03:20:41,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:20:41,149 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 28 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) Word has length 29 [2024-11-28 03:20:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:41,150 INFO L225 Difference]: With dead ends: 99 [2024-11-28 03:20:41,150 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 03:20:41,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1201, Unknown=1, NotChecked=74, Total=1560 [2024-11-28 03:20:41,152 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:41,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 271 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 500 Invalid, 0 Unknown, 75 Unchecked, 0.4s Time] [2024-11-28 03:20:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 03:20:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-28 03:20:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2024-11-28 03:20:41,159 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 29 [2024-11-28 03:20:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2024-11-28 03:20:41,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 28 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 03:20:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2024-11-28 03:20:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 03:20:41,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:41,160 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:41,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:20:41,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 03:20:41,366 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:41,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1739928861, now seen corresponding path program 1 times [2024-11-28 03:20:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845282118] [2024-11-28 03:20:41,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:41,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845282118] [2024-11-28 03:20:41,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845282118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:41,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283207124] [2024-11-28 03:20:41,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:41,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:41,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:41,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:41,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:20:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:41,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 03:20:41,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:41,727 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 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:20:41,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:41,766 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 03:20:41,794 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 11 treesize of output 7 [2024-11-28 03:20:41,830 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:20:41,830 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 03:20:41,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-28 03:20:41,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:41,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 03:20:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:41,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:42,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:42,175 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 19 treesize of output 20 [2024-11-28 03:20:42,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:42,185 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 33 treesize of output 33 [2024-11-28 03:20:42,191 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 03:20:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283207124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:42,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 22 [2024-11-28 03:20:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820345963] [2024-11-28 03:20:42,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:42,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:20:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:42,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:20:42,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=390, Unknown=6, NotChecked=0, Total=462 [2024-11-28 03:20:42,358 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:43,291 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2024-11-28 03:20:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 03:20:43,291 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 03:20:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:43,292 INFO L225 Difference]: With dead ends: 124 [2024-11-28 03:20:43,292 INFO L226 Difference]: Without dead ends: 124 [2024-11-28 03:20:43,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1303, Unknown=6, NotChecked=0, Total=1640 [2024-11-28 03:20:43,294 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 121 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:43,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 249 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:20:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-28 03:20:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2024-11-28 03:20:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-28 03:20:43,297 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 29 [2024-11-28 03:20:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:43,298 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-28 03:20:43,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-28 03:20:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:20:43,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:43,298 INFO L218 NwaCegarLoop]: trace histogram [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 03:20:43,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:20:43,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 03:20:43,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:43,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash 676360089, now seen corresponding path program 1 times [2024-11-28 03:20:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:43,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768936897] [2024-11-28 03:20:43,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:43,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768936897] [2024-11-28 03:20:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768936897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119736481] [2024-11-28 03:20:43,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:43,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:43,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:43,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:43,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:20:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:44,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 03:20:44,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:44,142 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 03:20:44,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:44,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-28 03:20:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:44,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:20:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119736481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:20:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2024-11-28 03:20:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703842315] [2024-11-28 03:20:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:44,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:20:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:20:44,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:20:44,242 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 03:20:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:44,433 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-11-28 03:20:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:20:44,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 03:20:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:44,434 INFO L225 Difference]: With dead ends: 91 [2024-11-28 03:20:44,434 INFO L226 Difference]: Without dead ends: 90 [2024-11-28 03:20:44,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2024-11-28 03:20:44,435 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:44,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 152 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-28 03:20:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-28 03:20:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 86 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-28 03:20:44,438 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 30 [2024-11-28 03:20:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:44,438 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-28 03:20:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 03:20:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-28 03:20:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:20:44,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:44,439 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:44,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:20:44,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 03:20:44,640 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:44,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1475734526, now seen corresponding path program 1 times [2024-11-28 03:20:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:44,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380660855] [2024-11-28 03:20:44,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380660855] [2024-11-28 03:20:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380660855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:20:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395063899] [2024-11-28 03:20:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:45,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:20:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:45,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:20:45,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:20:45,113 INFO L87 Difference]: Start difference. First operand 87 states and 98 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 03:20:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:45,354 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-11-28 03:20:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:20:45,355 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 31 [2024-11-28 03:20:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:45,356 INFO L225 Difference]: With dead ends: 91 [2024-11-28 03:20:45,356 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 03:20:45,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:20:45,356 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:45,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 148 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:20:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 03:20:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-28 03:20:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 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 03:20:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-28 03:20:45,359 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 31 [2024-11-28 03:20:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:45,359 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-28 03:20:45,360 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 03:20:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-28 03:20:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 03:20:45,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:45,360 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-28 03:20:45,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:20:45,361 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash -321940653, now seen corresponding path program 1 times [2024-11-28 03:20:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:45,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014749212] [2024-11-28 03:20:45,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:46,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:46,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014749212] [2024-11-28 03:20:46,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014749212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:46,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842833754] [2024-11-28 03:20:46,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:46,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:46,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:46,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:20:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:46,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 03:20:46,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:46,165 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 03:20:46,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:46,201 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 03:20:46,210 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 11 treesize of output 7 [2024-11-28 03:20:46,230 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:20:46,230 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 03:20:46,266 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-28 03:20:46,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-28 03:20:46,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-28 03:20:46,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:46,498 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 3 case distinctions, treesize of input 46 treesize of output 38 [2024-11-28 03:20:46,598 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:20:46,599 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 03:20:46,639 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 03:20:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:46,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:47,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:47,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 406 treesize of output 456 [2024-11-28 03:20:48,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:48,420 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 19 treesize of output 20 [2024-11-28 03:20:48,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:48,430 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 33 treesize of output 33 [2024-11-28 03:20:48,435 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 03:20:48,461 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:20:48,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 1 [2024-11-28 03:20:48,467 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:20:48,467 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 18 treesize of output 1 [2024-11-28 03:20:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842833754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:48,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 36 [2024-11-28 03:20:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213278776] [2024-11-28 03:20:48,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:48,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-28 03:20:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:48,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-28 03:20:48,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1174, Unknown=1, NotChecked=0, Total=1332 [2024-11-28 03:20:48,567 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 37 states, 36 states have (on average 2.25) internal successors, (81), 37 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 03:20:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:49,713 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-28 03:20:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:20:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.25) internal successors, (81), 37 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) Word has length 34 [2024-11-28 03:20:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:49,715 INFO L225 Difference]: With dead ends: 96 [2024-11-28 03:20:49,715 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 03:20:49,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=416, Invalid=2235, Unknown=1, NotChecked=0, Total=2652 [2024-11-28 03:20:49,716 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 116 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:49,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 279 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:20:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 03:20:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2024-11-28 03:20:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 90 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-28 03:20:49,719 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 34 [2024-11-28 03:20:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-28 03:20:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.25) internal successors, (81), 37 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 03:20:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-28 03:20:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 03:20:49,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:49,720 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-28 03:20:49,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:20:49,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:49,925 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:49,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash -321940652, now seen corresponding path program 1 times [2024-11-28 03:20:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810165831] [2024-11-28 03:20:49,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:49,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:50,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810165831] [2024-11-28 03:20:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810165831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071403362] [2024-11-28 03:20:50,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:50,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:50,405 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:50,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:20:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:50,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-28 03:20:50,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:50,577 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 03:20:50,580 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 03:20:50,679 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:20:50,679 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 03:20:50,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:50,695 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 03:20:50,726 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 11 treesize of output 7 [2024-11-28 03:20:50,732 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 11 treesize of output 7 [2024-11-28 03:20:50,784 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:20:50,784 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 59 treesize of output 52 [2024-11-28 03:20:50,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 03:20:50,856 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 03:20:50,857 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-28 03:20:50,878 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 03:20:50,878 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 15 treesize of output 15 [2024-11-28 03:20:50,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-28 03:20:50,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:20:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-28 03:20:51,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 03:20:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:51,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:51,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:51,774 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 70 treesize of output 88 [2024-11-28 03:20:52,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:52,006 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 20 treesize of output 21 [2024-11-28 03:20:52,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:52,017 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 34 treesize of output 34 [2024-11-28 03:20:52,022 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 03:20:52,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:52,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-28 03:20:52,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:20:52,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:52,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-11-28 03:20:52,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:20:52,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-28 03:20:52,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:20:52,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:52,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-28 03:20:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071403362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:20:52,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:20:52,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2024-11-28 03:20:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843092842] [2024-11-28 03:20:52,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:52,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-28 03:20:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:52,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-28 03:20:52,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=832, Unknown=5, NotChecked=0, Total=930 [2024-11-28 03:20:52,389 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 31 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:53,498 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2024-11-28 03:20:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:20:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 31 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-28 03:20:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:53,499 INFO L225 Difference]: With dead ends: 104 [2024-11-28 03:20:53,500 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 03:20:53,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=300, Invalid=1587, Unknown=5, NotChecked=0, Total=1892 [2024-11-28 03:20:53,501 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 123 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:53,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 301 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:20:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 03:20:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2024-11-28 03:20:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 82 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-11-28 03:20:53,504 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 34 [2024-11-28 03:20:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:53,504 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-11-28 03:20:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 31 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-11-28 03:20:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 03:20:53,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:53,505 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:20:53,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:20:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:53,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:20:53,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:53,710 INFO L85 PathProgramCache]: Analyzing trace with hash 575734698, now seen corresponding path program 1 times [2024-11-28 03:20:53,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:53,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029855423] [2024-11-28 03:20:53,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029855423] [2024-11-28 03:20:54,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029855423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450804005] [2024-11-28 03:20:54,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:54,578 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:54,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:20:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:54,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 03:20:54,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:54,737 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 03:20:54,754 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 03:20:54,759 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 03:20:54,825 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:54,825 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 03:20:54,871 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 19 treesize of output 18 [2024-11-28 03:20:54,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:20:54,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:54,963 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-28 03:20:54,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 60 [2024-11-28 03:20:54,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:54,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2024-11-28 03:20:55,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 03:20:55,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:55,104 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2024-11-28 03:20:55,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 51 [2024-11-28 03:20:56,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:56,045 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:20:56,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:20:56,056 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-11-28 03:20:56,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 71 treesize of output 33 [2024-11-28 03:20:56,072 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:20:56,072 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 31 treesize of output 16 [2024-11-28 03:20:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:56,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:21:27,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:27,722 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2024-11-28 03:21:27,723 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 57 treesize of output 45 [2024-11-28 03:21:27,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:27,746 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:27,845 INFO L349 Elim1Store]: treesize reduction 100, result has 40.8 percent of original size [2024-11-28 03:21:27,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 1614 treesize of output 731 [2024-11-28 03:21:27,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:21:27,901 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 52 treesize of output 52 [2024-11-28 03:21:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:21:27,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:21:28,005 INFO L349 Elim1Store]: treesize reduction 27, result has 44.9 percent of original size [2024-11-28 03:21:28,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 969 treesize of output 856 [2024-11-28 03:21:28,198 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 7 [2024-11-28 03:21:28,255 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:21:28,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2024-11-28 03:21:28,299 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 03:21:28,299 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 59 treesize of output 51 [2024-11-28 03:21:28,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,367 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:21:28,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 292 [2024-11-28 03:21:28,454 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,457 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,584 INFO L349 Elim1Store]: treesize reduction 449, result has 27.8 percent of original size [2024-11-28 03:21:28,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1564 treesize of output 1346 [2024-11-28 03:21:28,681 INFO L349 Elim1Store]: treesize reduction 141, result has 2.8 percent of original size [2024-11-28 03:21:28,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2090 treesize of output 1654 [2024-11-28 03:21:28,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,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 296 treesize of output 288 [2024-11-28 03:21:28,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,773 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 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-28 03:21:28,866 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:21:28,866 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 38 treesize of output 33 [2024-11-28 03:21:28,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:21:28,925 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2024-11-28 03:21:28,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 164 treesize of output 149 [2024-11-28 03:21:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:33,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450804005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:21:33,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:21:33,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2024-11-28 03:21:33,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445805128] [2024-11-28 03:21:33,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:21:33,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 03:21:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:33,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 03:21:33,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1271, Unknown=8, NotChecked=0, Total=1406 [2024-11-28 03:21:33,159 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:38,907 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2024-11-28 03:21:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 03:21:38,913 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-28 03:21:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:38,914 INFO L225 Difference]: With dead ends: 139 [2024-11-28 03:21:38,914 INFO L226 Difference]: Without dead ends: 139 [2024-11-28 03:21:38,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=459, Invalid=3073, Unknown=8, NotChecked=0, Total=3540 [2024-11-28 03:21:38,921 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 114 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:38,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 507 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 03:21:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-28 03:21:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 122. [2024-11-28 03:21:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 121 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-28 03:21:38,929 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 34 [2024-11-28 03:21:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:38,930 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-28 03:21:38,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-28 03:21:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 03:21:38,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:38,932 INFO L218 NwaCegarLoop]: trace histogram [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 03:21:38,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:39,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 03:21:39,132 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:21:39,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash 575745683, now seen corresponding path program 1 times [2024-11-28 03:21:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:39,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106539308] [2024-11-28 03:21:39,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:39,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106539308] [2024-11-28 03:21:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106539308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633913717] [2024-11-28 03:21:39,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:39,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:39,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:39,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:21:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:39,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:21:39,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:39,677 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 03:21:39,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:21:39,732 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 03:21:39,769 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 11 treesize of output 7 [2024-11-28 03:21:39,817 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:21:39,817 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 03:21:39,869 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 29 treesize of output 24 [2024-11-28 03:21:40,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:21:40,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2024-11-28 03:21:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:40,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:21:40,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:21:40,366 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 18 treesize of output 19 [2024-11-28 03:21:40,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:21:40,379 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 30 treesize of output 30 [2024-11-28 03:21:40,386 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 03:21:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633913717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:21:40,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:21:40,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 21 [2024-11-28 03:21:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256967998] [2024-11-28 03:21:40,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:21:40,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:21:40,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:40,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:21:40,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=394, Unknown=2, NotChecked=0, Total=462 [2024-11-28 03:21:40,611 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:41,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_main_~y~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_86| Int)) (or (< (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_86|) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_main_~list~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_86|))) (<= (+ (select .cse1 |c_ULTIMATE.start_main_~y~0#1.offset|) 1) |c_#StackHeapBarrier|) (<= (+ (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse2 8))))) is different from false [2024-11-28 03:21:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:41,593 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-11-28 03:21:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 03:21:41,594 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-28 03:21:41,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:41,594 INFO L225 Difference]: With dead ends: 137 [2024-11-28 03:21:41,595 INFO L226 Difference]: Without dead ends: 137 [2024-11-28 03:21:41,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=1191, Unknown=3, NotChecked=74, Total=1560 [2024-11-28 03:21:41,595 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:41,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 274 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 591 Invalid, 0 Unknown, 19 Unchecked, 0.5s Time] [2024-11-28 03:21:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-28 03:21:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2024-11-28 03:21:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 123 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 03:21:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2024-11-28 03:21:41,599 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 34 [2024-11-28 03:21:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:41,599 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2024-11-28 03:21:41,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2024-11-28 03:21:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:21:41,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:41,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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 03:21:41,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 03:21:41,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:41,804 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:21:41,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 576110070, now seen corresponding path program 2 times [2024-11-28 03:21:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:41,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18131743] [2024-11-28 03:21:41,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:21:41,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:41,834 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:21:41,834 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:21:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18131743] [2024-11-28 03:21:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18131743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551936826] [2024-11-28 03:21:42,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:21:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:42,536 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:42,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:21:42,690 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:21:42,690 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:21:42,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 03:21:42,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:42,706 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 03:21:42,740 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 03:21:42,745 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 03:21:42,759 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 19 treesize of output 18 [2024-11-28 03:21:42,767 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 19 treesize of output 18 [2024-11-28 03:21:42,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 03:21:42,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 03:21:43,037 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:21:43,038 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 03:21:43,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-28 03:21:43,145 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 21 [2024-11-28 03:21:43,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:21:43,286 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-11-28 03:21:43,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 131 treesize of output 102 [2024-11-28 03:21:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:21:43,333 INFO L349 Elim1Store]: treesize reduction 52, result has 37.3 percent of original size [2024-11-28 03:21:43,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 51 [2024-11-28 03:21:43,644 INFO L349 Elim1Store]: treesize reduction 90, result has 15.9 percent of original size [2024-11-28 03:21:43,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 167 treesize of output 117 [2024-11-28 03:21:43,657 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 145 treesize of output 116 [2024-11-28 03:21:45,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:21:45,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 278 treesize of output 410 [2024-11-28 03:21:46,551 INFO L349 Elim1Store]: treesize reduction 226, result has 64.6 percent of original size [2024-11-28 03:21:46,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 3 disjoint index pairs (out of 136 index pairs), introduced 20 new quantified variables, introduced 136 case distinctions, treesize of input 414 treesize of output 637 [2024-11-28 03:23:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:23:02,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:23:46,122 INFO L349 Elim1Store]: treesize reduction 1107, result has 11.2 percent of original size [2024-11-28 03:23:46,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 670 treesize of output 701 [2024-11-28 03:23:46,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:23:46,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 443 treesize of output 349 [2024-11-28 03:23:46,181 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 313 treesize of output 311 [2024-11-28 03:23:46,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:23:46,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 385 [2024-11-28 03:23:46,558 INFO L349 Elim1Store]: treesize reduction 70, result has 43.5 percent of original size [2024-11-28 03:23:46,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 444 treesize of output 233 [2024-11-28 03:23:46,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:23:46,594 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 216 treesize of output 204 [2024-11-28 03:23:46,610 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 151 treesize of output 147 [2024-11-28 03:23:46,710 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 03:23:46,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:23:46,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 66 [2024-11-28 03:23:46,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:23:46,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:23:47,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:23:47,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 70 [2024-11-28 03:23:47,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:23:47,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2024-11-28 03:23:47,174 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 03:23:47,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 85 [2024-11-28 03:23:47,357 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 03:23:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:23:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551936826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:23:47,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:23:47,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 43 [2024-11-28 03:23:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952386261] [2024-11-28 03:23:47,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:23:47,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 03:23:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:23:47,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 03:23:47,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1648, Unknown=15, NotChecked=0, Total=1806 [2024-11-28 03:23:47,643 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 43 states, 43 states have (on average 2.372093023255814) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:23:55,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 03:24:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:01,019 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2024-11-28 03:24:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 03:24:01,021 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.372093023255814) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 03:24:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:01,022 INFO L225 Difference]: With dead ends: 181 [2024-11-28 03:24:01,022 INFO L226 Difference]: Without dead ends: 181 [2024-11-28 03:24:01,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=326, Invalid=3561, Unknown=19, NotChecked=0, Total=3906 [2024-11-28 03:24:01,023 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 95 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 33 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:01,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 601 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 944 Invalid, 17 Unknown, 0 Unchecked, 7.8s Time] [2024-11-28 03:24:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-28 03:24:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2024-11-28 03:24:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 155 states have (on average 1.1806451612903226) internal successors, (183), 166 states have internal predecessors, (183), 0 states have call successors, (0), 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 03:24:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 183 transitions. [2024-11-28 03:24:01,029 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 183 transitions. Word has length 38 [2024-11-28 03:24:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 183 transitions. [2024-11-28 03:24:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.372093023255814) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 183 transitions. [2024-11-28 03:24:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:24:01,030 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:01,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:01,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 03:24:01,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:01,231 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:24:01,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash 576113016, now seen corresponding path program 2 times [2024-11-28 03:24:01,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:01,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389220541] [2024-11-28 03:24:01,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:24:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:01,251 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:24:01,251 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389220541] [2024-11-28 03:24:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389220541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:24:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416155597] [2024-11-28 03:24:02,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:24:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:02,385 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:02,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 03:24:02,558 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:24:02,558 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:02,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 03:24:02,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:02,763 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-28 03:24:02,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-28 03:24:02,924 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 11 treesize of output 7 [2024-11-28 03:24:03,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:24:03,090 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 49 treesize of output 46 [2024-11-28 03:24:03,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2024-11-28 03:24:03,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2024-11-28 03:24:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:04,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:05,476 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_102| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_102| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_102|) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_102|) 0)))) is different from false [2024-11-28 03:24:05,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1443 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_102| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_102| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_102|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1443) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_102|) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-28 03:24:05,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:05,588 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 28 treesize of output 29 [2024-11-28 03:24:05,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:05,617 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 50 treesize of output 50 [2024-11-28 03:24:05,626 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 19 treesize of output 17 [2024-11-28 03:24:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416155597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:24:10,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:24:10,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 32 [2024-11-28 03:24:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261564925] [2024-11-28 03:24:10,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:24:10,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:24:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:10,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:24:10,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=833, Unknown=3, NotChecked=118, Total=1056 [2024-11-28 03:24:10,860 INFO L87 Difference]: Start difference. First operand 167 states and 183 transitions. Second operand has 33 states, 32 states have (on average 2.96875) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 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 03:24:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:14,094 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2024-11-28 03:24:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:24:14,095 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 03:24:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:14,096 INFO L225 Difference]: With dead ends: 183 [2024-11-28 03:24:14,097 INFO L226 Difference]: Without dead ends: 162 [2024-11-28 03:24:14,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=142, Invalid=1123, Unknown=3, NotChecked=138, Total=1406 [2024-11-28 03:24:14,098 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:14,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 355 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 748 Invalid, 0 Unknown, 131 Unchecked, 2.4s Time] [2024-11-28 03:24:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-28 03:24:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2024-11-28 03:24:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 160 states have internal predecessors, (176), 0 states have call successors, (0), 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 03:24:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2024-11-28 03:24:14,104 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 38 [2024-11-28 03:24:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:14,104 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2024-11-28 03:24:14,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 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 03:24:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2024-11-28 03:24:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 03:24:14,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:14,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:14,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:14,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:14,306 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:24:14,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1856753344, now seen corresponding path program 1 times [2024-11-28 03:24:14,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:14,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628973686] [2024-11-28 03:24:14,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628973686] [2024-11-28 03:24:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628973686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:24:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330311346] [2024-11-28 03:24:17,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:17,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:17,396 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:17,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 03:24:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:17,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-28 03:24:17,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:17,931 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)) is different from false [2024-11-28 03:24:17,937 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)) is different from true [2024-11-28 03:24:17,987 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 03:24:18,000 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) is different from false [2024-11-28 03:24:18,005 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) is different from true [2024-11-28 03:24:18,063 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:24:18,063 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 66 treesize of output 59 [2024-11-28 03:24:18,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (store |v_#valid_96| .cse0 0))) (let ((.cse1 (@diff |v_#valid_96| .cse2))) (and (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse2) (= .cse1 .cse0))))))) is different from false [2024-11-28 03:24:18,117 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (store |v_#valid_96| .cse0 0))) (let ((.cse1 (@diff |v_#valid_96| .cse2))) (and (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse2) (= .cse1 .cse0))))))) is different from true [2024-11-28 03:24:18,246 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (let ((.cse1 (store |v_#valid_96| .cse2 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1)) (.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse1) (= .cse0 .cse2) (= (select .cse3 |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store .cse3 |c_ULTIMATE.start_main_#t~malloc8#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|))))))))) is different from false [2024-11-28 03:24:18,252 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (let ((.cse1 (store |v_#valid_96| .cse2 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1)) (.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse1) (= .cse0 .cse2) (= (select .cse3 |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store .cse3 |c_ULTIMATE.start_main_#t~malloc8#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|))))))))) is different from true [2024-11-28 03:24:18,276 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 56 treesize of output 32 [2024-11-28 03:24:18,335 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse1 (select .cse5 8)) (.cse2 (@diff |v_#valid_96| .cse3))) (and (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse4)))))))) is different from false [2024-11-28 03:24:18,341 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse1 (select .cse5 8)) (.cse2 (@diff |v_#valid_96| .cse3))) (and (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse4)))))))) is different from true [2024-11-28 03:24:18,463 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse1 (select .cse5 8))) (and (= (select .cse0 .cse1) 0) (= (select |v_#valid_96| .cse2) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse4 .cse2) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))))))))) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0)) is different from false [2024-11-28 03:24:18,469 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse1 (select .cse5 8))) (and (= (select .cse0 .cse1) 0) (= (select |v_#valid_96| .cse2) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse4 .cse2) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))))))))) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0)) is different from true [2024-11-28 03:24:18,726 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse1 (select .cse5 8))) (and (= (select .cse0 .cse1) 0) (= (select |v_#valid_96| .cse2) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse4 .cse2) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))))))))) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0)) is different from false [2024-11-28 03:24:18,731 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse1 (select .cse5 8))) (and (= (select .cse0 .cse1) 0) (= (select |v_#valid_96| .cse2) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse4 .cse2) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))))))))) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0)) is different from true [2024-11-28 03:24:18,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse4 (select .cse5 0))) (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse1 (select .cse5 8)) (.cse2 (@diff |v_#valid_96| .cse3))) (and (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse4))))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse4)))) is different from false [2024-11-28 03:24:18,831 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse4 (select .cse5 0))) (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse1 (select .cse5 8)) (.cse2 (@diff |v_#valid_96| .cse3))) (and (= |c_#valid| (store .cse0 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse4))))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse4)))) is different from true [2024-11-28 03:24:18,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse0 (select .cse5 0))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse4 (store |v_#valid_96| .cse0 0))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse2 (select .cse5 8)) (.cse3 (@diff |v_#valid_96| .cse4))) (and (= |c_#valid| (store .cse1 .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_96| .cse3) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse1 .cse2) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse4) (= .cse3 .cse0)))))))) is different from false [2024-11-28 03:24:18,933 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse0 (select .cse5 0))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse4 (store |v_#valid_96| .cse0 0))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse2 (select .cse5 8)) (.cse3 (@diff |v_#valid_96| .cse4))) (and (= |c_#valid| (store .cse1 .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_96| .cse3) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse1 .cse2) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse4) (= .cse3 .cse0)))))))) is different from true [2024-11-28 03:24:19,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:19,104 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 2 case distinctions, treesize of input 88 treesize of output 68 [2024-11-28 03:24:19,280 WARN L851 $PredicateComparison]: unable to prove that (and (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (or (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_96| .cse2)) (.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse0 |c_ULTIMATE.start_main_#t~mem11#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|))))) (and (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)) (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse5 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse3 (@diff |v_#valid_96| .cse5))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3) (= (select .cse4 v_arrayElimCell_236) 0) (= |c_#valid| (store .cse4 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236))) (= (select |v_#valid_96| .cse3) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|)))))))) is different from false [2024-11-28 03:24:19,286 WARN L873 $PredicateComparison]: unable to prove that (and (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (or (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_96| .cse2)) (.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse0 |c_ULTIMATE.start_main_#t~mem11#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|))))) (and (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)) (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse5 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse3 (@diff |v_#valid_96| .cse5))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3) (= (select .cse4 v_arrayElimCell_236) 0) (= |c_#valid| (store .cse4 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236))) (= (select |v_#valid_96| .cse3) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|)))))))) is different from true [2024-11-28 03:24:19,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)))) (or (and .cse0 (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_96| .cse3)) (.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select .cse2 v_arrayElimCell_236) 0) (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse2 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse4 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse10 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff |v_#valid_96| .cse10)) (.cse9 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse8) (= (select |v_#valid_96| .cse8) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse9 |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse10 |c_ULTIMATE.start_main_old_#valid#1|) (= (select .cse9 |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))))) (or .cse4 (and .cse0 (or .cse4 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int) (v_arrayElimCell_236 Int)) (let ((.cse7 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse5 (@diff |v_#valid_96| .cse7)) (.cse6 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5) (= (select .cse6 v_arrayElimCell_236) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_24| v_arrayElimCell_236)) (= (select |v_#valid_96| .cse5) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|)))))))))))) is different from false [2024-11-28 03:24:19,985 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)))) (or (and .cse0 (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_96| .cse3)) (.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select .cse2 v_arrayElimCell_236) 0) (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse2 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse4 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse10 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff |v_#valid_96| .cse10)) (.cse9 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse8) (= (select |v_#valid_96| .cse8) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse9 |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse10 |c_ULTIMATE.start_main_old_#valid#1|) (= (select .cse9 |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))))) (or .cse4 (and .cse0 (or .cse4 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int) (v_arrayElimCell_236 Int)) (let ((.cse7 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse5 (@diff |v_#valid_96| .cse7)) (.cse6 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5) (= (select .cse6 v_arrayElimCell_236) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_24| v_arrayElimCell_236)) (= (select |v_#valid_96| .cse5) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|)))))))))))) is different from true [2024-11-28 03:24:20,040 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse2)) (.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) is different from false [2024-11-28 03:24:20,152 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= (select |v_#valid_96| .cse0) 1) (= |c_#valid| (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0)) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) is different from false [2024-11-28 03:24:20,263 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_96| .cse0))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse0) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= (select |v_#valid_96| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) (= |c_#valid| (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0)) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) is different from false [2024-11-28 03:24:20,627 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_114| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse1 (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_114| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= (select |v_#valid_96| .cse0) 1) (= |c_#valid| (store (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0) |v_ULTIMATE.start_main_~y~0#1.base_114| 0)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_114|) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) is different from false [2024-11-28 03:24:20,633 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_114| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse1 (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_114| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= (select |v_#valid_96| .cse0) 1) (= |c_#valid| (store (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0) |v_ULTIMATE.start_main_~y~0#1.base_114| 0)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_114|) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) is different from true [2024-11-28 03:24:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-28 03:24:20,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:21,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_109| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_109| 0) (= (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select .cse0 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_109|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_109|))) is different from false [2024-11-28 03:24:21,890 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_109| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_109| 0) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select (store .cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|) 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_109|) 0))) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_109|))) is different from false [2024-11-28 03:24:22,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:22,577 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 54 treesize of output 47 [2024-11-28 03:24:22,587 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 78 treesize of output 72 [2024-11-28 03:24:22,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:22,687 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 63 treesize of output 79 [2024-11-28 03:24:22,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:22,736 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 55 treesize of output 58 [2024-11-28 03:24:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330311346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:24:40,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:24:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 50 [2024-11-28 03:24:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771759130] [2024-11-28 03:24:40,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:24:40,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 03:24:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:40,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 03:24:40,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1030, Unknown=31, NotChecked=1360, Total=2550 [2024-11-28 03:24:40,578 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand has 51 states, 50 states have (on average 2.28) internal successors, (114), 51 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:43,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:24:44,935 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_#valid| 0) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-28 03:24:44,942 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_#valid| 0) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from true [2024-11-28 03:24:44,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| .cse2 0) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from false [2024-11-28 03:24:44,959 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| .cse2 0) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from true [2024-11-28 03:24:44,970 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (store |v_#valid_96| .cse0 0))) (let ((.cse1 (@diff |v_#valid_96| .cse2))) (and (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse2) (= .cse1 .cse0))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from false [2024-11-28 03:24:44,977 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse2 (store |v_#valid_96| .cse0 0))) (let ((.cse1 (@diff |v_#valid_96| .cse2))) (and (= (select |v_#valid_96| .cse1) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse2) (= .cse1 .cse0))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from true [2024-11-28 03:24:45,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_109| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_109| 0) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| (select (store .cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|) 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_109|) 0)) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_109|))) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse0 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse0) (= (select .cse4 |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store .cse4 |c_ULTIMATE.start_main_#t~malloc8#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|))))))) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse0)) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_#t~malloc8#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| 0))))) is different from false [2024-11-28 03:24:45,014 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_109| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_109| 0) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| (select (store .cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|) 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_109|) 0)) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_109|))) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse0 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse0) (= (select .cse4 |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store .cse4 |c_ULTIMATE.start_main_#t~malloc8#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|))))))) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse0)) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_#t~malloc8#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| 0))))) is different from true [2024-11-28 03:24:45,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= .cse0 .cse1)) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_109| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_109| 0) (= (store (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_109|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_109|))) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (store |v_#valid_96| .cse1 0))) (let ((.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse4 (@diff |v_#valid_96| .cse5))) (and (= |c_#valid| (store .cse3 .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_96| .cse4) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse3 .cse0) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5) (= .cse4 .cse1))))) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) .cse1 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse0 0))))) is different from false [2024-11-28 03:24:45,061 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= .cse0 .cse1)) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_109| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_109| 0) (= (store (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_109|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_109|))) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse5 (store |v_#valid_96| .cse1 0))) (let ((.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse4 (@diff |v_#valid_96| .cse5))) (and (= |c_#valid| (store .cse3 .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_96| .cse4) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse3 .cse0) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5) (= .cse4 .cse1))))) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) .cse1 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse0 0))))) is different from true [2024-11-28 03:24:45,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (select .cse5 8)) (.cse4 (select .cse5 0))) (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1))) (and (= (select .cse1 .cse0) 0) (= (select |v_#valid_96| .cse2) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse4 .cse2) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse4)) (not (= .cse0 .cse4)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) .cse0 0) .cse4 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-28 03:24:45,300 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (select .cse5 8)) (.cse4 (select .cse5 0))) (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse2 (@diff |v_#valid_96| .cse3)) (.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1))) (and (= (select .cse1 .cse0) 0) (= (select |v_#valid_96| .cse2) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse4 .cse2) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse4)) (not (= .cse0 .cse4)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) .cse0 0) .cse4 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from true [2024-11-28 03:24:45,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) .cse1 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse6 (select .cse7 0))) (let ((.cse5 (store |v_#valid_96| .cse6 0))) (let ((.cse4 (@diff |v_#valid_96| .cse5)) (.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse3 (select .cse7 8))) (and (= (select .cse2 .cse3) 0) (= (select |v_#valid_96| .cse4) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5) (= .cse6 .cse4) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse2 .cse3 (select |c_#valid| .cse3)))))))) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse0 .cse1)) (not (= .cse0 0))))) is different from false [2024-11-28 03:24:45,445 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) .cse1 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse6 (select .cse7 0))) (let ((.cse5 (store |v_#valid_96| .cse6 0))) (let ((.cse4 (@diff |v_#valid_96| .cse5)) (.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse3 (select .cse7 8))) (and (= (select .cse2 .cse3) 0) (= (select |v_#valid_96| .cse4) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5) (= .cse6 .cse4) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= |c_#valid| (store .cse2 .cse3 (select |c_#valid| .cse3)))))))) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse0 .cse1)) (not (= .cse0 0))))) is different from true [2024-11-28 03:24:45,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse4 (select .cse5 0)) (.cse0 (select .cse5 8))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|)) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_#t~mem9#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse2 (@diff |v_#valid_96| .cse3))) (and (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse1 .cse0) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse4))))) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse4) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))))) is different from false [2024-11-28 03:24:45,567 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse4 (select .cse5 0)) (.cse0 (select .cse5 8))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|)) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_#t~mem9#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse3 (store |v_#valid_96| .cse4 0))) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse2 (@diff |v_#valid_96| .cse3))) (and (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse1 .cse0) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= .cse2 .cse4))))) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse4) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))))) is different from true [2024-11-28 03:24:45,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse0 (select .cse5 0)) (.cse1 (select .cse5 8))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (not (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse1 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse4 (store |v_#valid_96| .cse0 0))) (let ((.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse3 (@diff |v_#valid_96| .cse4))) (and (= |c_#valid| (store .cse2 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_96| .cse3) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse2 .cse1) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse4) (= .cse3 .cse0))))) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse1 0))))) is different from false [2024-11-28 03:24:45,584 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse0 (select .cse5 0)) (.cse1 (select .cse5 8))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (not (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse1 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse4 (store |v_#valid_96| .cse0 0))) (let ((.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse3 (@diff |v_#valid_96| .cse4))) (and (= |c_#valid| (store .cse2 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_96| .cse3) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select .cse2 .cse1) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse4) (= .cse3 .cse0))))) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse1 0))))) is different from true [2024-11-28 03:24:46,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse3 (not .cse2))) (and (or (and (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_#t~mem11#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not .cse0)) (not (= .cse1 1))) .cse2 (not (= |c_ULTIMATE.start_main_#t~mem11#1.base| 0)) (or .cse3 (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) .cse0) (or (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse6 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse5 (@diff |v_#valid_96| .cse6)) (.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select .cse4 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5) (= (select |v_#valid_96| .cse5) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse4 |c_ULTIMATE.start_main_#t~mem11#1.base| .cse1)) (= .cse6 |c_ULTIMATE.start_main_old_#valid#1|))))) (and .cse3 (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse9 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse7 (@diff |v_#valid_96| .cse9))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse7) (= (select .cse8 v_arrayElimCell_236) 0) (= |c_#valid| (store .cse8 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236))) (= (select |v_#valid_96| .cse7) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= .cse9 |c_ULTIMATE.start_main_old_#valid#1|)))))))))) is different from false [2024-11-28 03:24:46,032 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse3 (not .cse2))) (and (or (and (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_#t~mem11#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not .cse0)) (not (= .cse1 1))) .cse2 (not (= |c_ULTIMATE.start_main_#t~mem11#1.base| 0)) (or .cse3 (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) .cse0) (or (exists ((|v_#valid_96| (Array Int Int))) (let ((.cse6 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse5 (@diff |v_#valid_96| .cse6)) (.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= (select .cse4 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5) (= (select |v_#valid_96| .cse5) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse4 |c_ULTIMATE.start_main_#t~mem11#1.base| .cse1)) (= .cse6 |c_ULTIMATE.start_main_old_#valid#1|))))) (and .cse3 (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse9 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1)) (.cse7 (@diff |v_#valid_96| .cse9))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse7) (= (select .cse8 v_arrayElimCell_236) 0) (= |c_#valid| (store .cse8 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236))) (= (select |v_#valid_96| .cse7) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= .cse9 |c_ULTIMATE.start_main_old_#valid#1|)))))))))) is different from true [2024-11-28 03:24:46,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (let ((.cse1 (not .cse0))) (or (and .cse1 (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_96| .cse4)) (.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select .cse3 v_arrayElimCell_236) 0) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse3 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse5 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse11 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse9 (@diff |v_#valid_96| .cse11)) (.cse10 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse9) (= (select |v_#valid_96| .cse9) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse10 |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse11 |c_ULTIMATE.start_main_old_#valid#1|) (= (select .cse10 |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))))) (or .cse5 (and .cse1 (or .cse5 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int) (v_arrayElimCell_236 Int)) (let ((.cse8 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse6 (@diff |v_#valid_96| .cse8)) (.cse7 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= (select .cse7 v_arrayElimCell_236) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_24| v_arrayElimCell_236)) (= (select |v_#valid_96| .cse6) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse7 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse8 |c_ULTIMATE.start_main_old_#valid#1|)))))))))))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-28 03:24:46,127 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (let ((.cse1 (not .cse0))) (or (and .cse1 (exists ((|v_#valid_96| (Array Int Int)) (v_arrayElimCell_236 Int)) (let ((.cse4 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_96| .cse4)) (.cse3 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select .cse3 v_arrayElimCell_236) 0) (= (select |v_#valid_96| .cse2) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse3 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse5 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse11 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse9 (@diff |v_#valid_96| .cse11)) (.cse10 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse9) (= (select |v_#valid_96| .cse9) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse10 |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse11 |c_ULTIMATE.start_main_old_#valid#1|) (= (select .cse10 |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))))) (or .cse5 (and .cse1 (or .cse5 (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int) (v_arrayElimCell_236 Int)) (let ((.cse8 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse6 (@diff |v_#valid_96| .cse8)) (.cse7 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= (select .cse7 v_arrayElimCell_236) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_24| v_arrayElimCell_236)) (= (select |v_#valid_96| .cse6) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store .cse7 v_arrayElimCell_236 (select |c_#valid| v_arrayElimCell_236)) |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse8 |c_ULTIMATE.start_main_old_#valid#1|)))))))))))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from true [2024-11-28 03:24:46,231 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse2)) (.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) is different from false [2024-11-28 03:24:46,238 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse2 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse2)) (.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| .cse0) 1) (= (select |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0)) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) is different from true [2024-11-28 03:24:46,407 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= (select |v_#valid_96| .cse0) 1) (= |c_#valid| (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0)) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0))) is different from false [2024-11-28 03:24:46,415 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse1 (store |v_#valid_96| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= (select |v_#valid_96| .cse0) 1) (= |c_#valid| (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0)) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0))) is different from true [2024-11-28 03:24:46,584 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_96| .cse0))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse0) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= (select |v_#valid_96| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) (= |c_#valid| (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0)) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0)))))) is different from false [2024-11-28 03:24:46,590 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse0 (store |v_#valid_96| |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_96| .cse0))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse0) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= (select |v_#valid_96| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) (= |c_#valid| (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0)) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0)))))) is different from true [2024-11-28 03:24:47,111 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_114| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse1 (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_114| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= (select |v_#valid_96| .cse0) 1) (= |c_#valid| (store (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0) |v_ULTIMATE.start_main_~y~0#1.base_114| 0)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_114|) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) (= |c_#valid| |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-28 03:24:47,117 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~y~0#1.base_113| Int) (|v_#valid_96| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_114| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_24| Int)) (let ((.cse1 (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_114| 0))) (let ((.cse0 (@diff |v_#valid_96| .cse1))) (and (= (select |v_#valid_96| .cse0) 1) (= |c_#valid| (store (store (store |v_#valid_96| |v_ULTIMATE.start_main_#t~mem11#1.base_24| 0) |v_ULTIMATE.start_main_~y~0#1.base_113| 0) |v_ULTIMATE.start_main_~y~0#1.base_114| 0)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113|) 0) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_114|) (= (select (store |v_#valid_96| |v_ULTIMATE.start_main_~y~0#1.base_113| 1) |v_ULTIMATE.start_main_#t~mem11#1.base_24|) 0))))) (= |c_#valid| |c_ULTIMATE.start_main_old_#valid#1|)) is different from true [2024-11-28 03:24:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:48,006 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2024-11-28 03:24:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:24:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.28) internal successors, (114), 51 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-28 03:24:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:48,008 INFO L225 Difference]: With dead ends: 163 [2024-11-28 03:24:48,008 INFO L226 Difference]: Without dead ends: 138 [2024-11-28 03:24:48,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=184, Invalid=1215, Unknown=61, NotChecked=3232, Total=4692 [2024-11-28 03:24:48,010 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 3182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2434 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:48,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 487 Invalid, 3182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 742 Invalid, 0 Unknown, 2434 Unchecked, 6.2s Time] [2024-11-28 03:24:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-28 03:24:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-28 03:24:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 126 states have (on average 1.2063492063492063) internal successors, (152), 137 states have internal predecessors, (152), 0 states have call successors, (0), 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 03:24:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-11-28 03:24:48,023 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 43 [2024-11-28 03:24:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:48,024 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-11-28 03:24:48,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.28) internal successors, (114), 51 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-11-28 03:24:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 03:24:48,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:48,025 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-28 03:24:48,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 03:24:48,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:48,229 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-28 03:24:48,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1362301817, now seen corresponding path program 1 times [2024-11-28 03:24:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929623536] [2024-11-28 03:24:48,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:50,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929623536] [2024-11-28 03:24:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929623536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:24:50,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837361135] [2024-11-28 03:24:50,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:50,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:50,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:50,375 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:50,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ab0122e-a5e1-49cf-b066-d7aaafff802d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 03:24:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:50,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-28 03:24:50,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:50,712 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 03:24:50,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:24:50,832 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 03:24:50,972 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 11 treesize of output 7 [2024-11-28 03:24:51,001 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 19 treesize of output 18 [2024-11-28 03:24:51,187 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:24:51,187 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 63 treesize of output 56 [2024-11-28 03:24:51,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-28 03:24:51,390 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 26 [2024-11-28 03:24:51,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 03:24:51,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-28 03:24:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:52,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:53,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:53,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 119 [2024-11-28 03:24:53,904 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 230 treesize of output 226 [2024-11-28 03:24:53,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:53,928 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 104 treesize of output 102 [2024-11-28 03:24:53,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:53,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:53,984 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 112 treesize of output 116 [2024-11-28 03:25:04,485 INFO L349 Elim1Store]: treesize reduction 249, result has 46.5 percent of original size [2024-11-28 03:25:04,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 1405 treesize of output 965 [2024-11-28 03:25:05,311 INFO L349 Elim1Store]: treesize reduction 214, result has 24.6 percent of original size [2024-11-28 03:25:05,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 1924 treesize of output 1985 [2024-11-28 03:25:05,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:25:05,570 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 245 treesize of output 263 [2024-11-28 03:25:08,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:25:14,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:25:14,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1578 treesize of output 1758