./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd --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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:53:47,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:53:48,014 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:53:48,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:53:48,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:53:48,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:53:48,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:53:48,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:53:48,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:53:48,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:53:48,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:53:48,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:53:48,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:53:48,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:53:48,065 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:53:48,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:53:48,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:53:48,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:53:48,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:53:48,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:53:48,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:53:48,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:53:48,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:53:48,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:53:48,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:53:48,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:53:48,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:53:48,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:53:48,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:53:48,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:53:48,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:53:48,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:53:48,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:53:48,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:53:48,073 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_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-13 15:53:48,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:53:48,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:53:48,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:53:48,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:53:48,477 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:53:48,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i Unable to find full path for "g++" [2024-11-13 15:53:50,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:53:50,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:53:50,861 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2024-11-13 15:53:50,878 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/data/213221939/35ed651c7e574752b74070e806165286/FLAGa3eb3ad9b [2024-11-13 15:53:50,892 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/data/213221939/35ed651c7e574752b74070e806165286 [2024-11-13 15:53:50,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:53:50,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:53:50,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:53:50,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:53:50,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:53:50,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:53:50" (1/1) ... [2024-11-13 15:53:50,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0fe130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:50, skipping insertion in model container [2024-11-13 15:53:50,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:53:50" (1/1) ... [2024-11-13 15:53:50,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:53:51,492 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 15:53:51,552 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 15:53:51,556 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 15:53:51,561 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 15:53:51,577 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 15:53:51,610 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 15:53:51,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:53:51,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:53:51,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:53:51,826 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:53:51,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51 WrapperNode [2024-11-13 15:53:51,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:53:51,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:53:51,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:53:51,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:53:51,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:51,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:51,935 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-13 15:53:51,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:53:51,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:53:51,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:53:51,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:53:51,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:51,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:51,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,039 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-13 15:53:52,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:53:52,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:53:52,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:53:52,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:53:52,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (1/1) ... [2024-11-13 15:53:52,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:53:52,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:52,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:53:52,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:53:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:53:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:53:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:53:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:53:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 15:53:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 15:53:52,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 15:53:52,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 15:53:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:53:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:53:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:53:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:53:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:53:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:53:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:53:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:53:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:53:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:53:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:53:52,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:53:52,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:53:52,480 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 15:53:52,535 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 15:53:54,870 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-11-13 15:53:54,870 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:53:54,901 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:53:54,902 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-13 15:53:54,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:53:54 BoogieIcfgContainer [2024-11-13 15:53:54,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:53:54,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:53:54,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:53:54,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:53:54,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:53:50" (1/3) ... [2024-11-13 15:53:54,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e64c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:53:54, skipping insertion in model container [2024-11-13 15:53:54,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:51" (2/3) ... [2024-11-13 15:53:54,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e64c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:53:54, skipping insertion in model container [2024-11-13 15:53:54,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:53:54" (3/3) ... [2024-11-13 15:53:54,913 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2024-11-13 15:53:54,932 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:53:54,934 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-1.i that has 3 procedures, 742 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-13 15:53:54,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:53:55,013 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;@5bde9e5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:53:55,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-13 15:53:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:53:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:53:55,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:55,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:53:55,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:53:55,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-13 15:53:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352834840] [2024-11-13 15:53:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:55,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:55,309 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-13 15:53:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352834840] [2024-11-13 15:53:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352834840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:55,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:55,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:53:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725513941] [2024-11-13 15:53:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:55,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:55,362 INFO L87 Difference]: Start difference. First operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:56,321 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-11-13 15:53:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:56,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-13 15:53:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:56,348 INFO L225 Difference]: With dead ends: 680 [2024-11-13 15:53:56,351 INFO L226 Difference]: Without dead ends: 678 [2024-11-13 15:53:56,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:56,356 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 678 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:56,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 469 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:53:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-13 15:53:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2024-11-13 15:53:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 409 states have (on average 1.8533007334963325) internal successors, (758), 671 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:53:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 764 transitions. [2024-11-13 15:53:56,494 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 764 transitions. Word has length 5 [2024-11-13 15:53:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:56,494 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 764 transitions. [2024-11-13 15:53:56,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 764 transitions. [2024-11-13 15:53:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:53:56,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:56,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:53:56,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:53:56,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:53:56,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-13 15:53:56,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:56,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932225423] [2024-11-13 15:53:56,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:56,666 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-13 15:53:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932225423] [2024-11-13 15:53:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932225423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:56,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:53:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326497181] [2024-11-13 15:53:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:56,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:56,670 INFO L87 Difference]: Start difference. First operand 676 states and 764 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:57,474 INFO L93 Difference]: Finished difference Result 753 states and 847 transitions. [2024-11-13 15:53:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:57,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-13 15:53:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:57,481 INFO L225 Difference]: With dead ends: 753 [2024-11-13 15:53:57,481 INFO L226 Difference]: Without dead ends: 753 [2024-11-13 15:53:57,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:57,483 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 416 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:57,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 828 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:53:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-13 15:53:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 705. [2024-11-13 15:53:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 449 states have (on average 1.8396436525612472) internal successors, (826), 700 states have internal predecessors, (826), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:53:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 832 transitions. [2024-11-13 15:53:57,524 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 832 transitions. Word has length 5 [2024-11-13 15:53:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:57,525 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 832 transitions. [2024-11-13 15:53:57,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 832 transitions. [2024-11-13 15:53:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:53:57,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:57,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:53:57,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:53:57,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:53:57,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1423330781, now seen corresponding path program 1 times [2024-11-13 15:53:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457428828] [2024-11-13 15:53:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:57,615 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-13 15:53:57,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457428828] [2024-11-13 15:53:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457428828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900525251] [2024-11-13 15:53:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:57,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:57,617 INFO L87 Difference]: Start difference. First operand 705 states and 832 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:57,692 INFO L93 Difference]: Finished difference Result 1386 states and 1639 transitions. [2024-11-13 15:53:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:57,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 15:53:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:57,700 INFO L225 Difference]: With dead ends: 1386 [2024-11-13 15:53:57,701 INFO L226 Difference]: Without dead ends: 1386 [2024-11-13 15:53:57,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:57,702 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 721 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:57,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1498 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:53:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-13 15:53:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 706. [2024-11-13 15:53:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 450 states have (on average 1.8377777777777777) internal successors, (827), 701 states have internal predecessors, (827), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:53:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-11-13 15:53:57,748 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-11-13 15:53:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-11-13 15:53:57,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-11-13 15:53:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 15:53:57,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:57,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:57,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:53:57,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:53:57,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480710, now seen corresponding path program 1 times [2024-11-13 15:53:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077174266] [2024-11-13 15:53:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:57,923 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-13 15:53:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:57,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077174266] [2024-11-13 15:53:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077174266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:57,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:57,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:57,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116811238] [2024-11-13 15:53:57,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:57,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:53:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:57,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:53:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:57,926 INFO L87 Difference]: Start difference. First operand 706 states and 833 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:58,868 INFO L93 Difference]: Finished difference Result 732 states and 886 transitions. [2024-11-13 15:53:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:53:58,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-13 15:53:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:58,873 INFO L225 Difference]: With dead ends: 732 [2024-11-13 15:53:58,873 INFO L226 Difference]: Without dead ends: 732 [2024-11-13 15:53:58,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:58,874 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 942 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:58,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 730 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:53:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-13 15:53:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 683. [2024-11-13 15:53:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 450 states have (on average 1.7866666666666666) internal successors, (804), 678 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:53:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 810 transitions. [2024-11-13 15:53:58,902 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 810 transitions. Word has length 15 [2024-11-13 15:53:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:58,902 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 810 transitions. [2024-11-13 15:53:58,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 810 transitions. [2024-11-13 15:53:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 15:53:58,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:58,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:58,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:53:58,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:53:58,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480711, now seen corresponding path program 1 times [2024-11-13 15:53:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423963302] [2024-11-13 15:53:58,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:59,039 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-13 15:53:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423963302] [2024-11-13 15:53:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423963302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143703292] [2024-11-13 15:53:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:59,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:59,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:59,042 INFO L87 Difference]: Start difference. First operand 683 states and 810 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:59,087 INFO L93 Difference]: Finished difference Result 608 states and 707 transitions. [2024-11-13 15:53:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-13 15:53:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:59,091 INFO L225 Difference]: With dead ends: 608 [2024-11-13 15:53:59,092 INFO L226 Difference]: Without dead ends: 608 [2024-11-13 15:53:59,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:59,094 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 61 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:59,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1177 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:53:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-13 15:53:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-13 15:53:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 387 states have (on average 1.8113695090439277) internal successors, (701), 603 states have internal predecessors, (701), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:53:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 707 transitions. [2024-11-13 15:53:59,122 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 707 transitions. Word has length 15 [2024-11-13 15:53:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:59,123 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 707 transitions. [2024-11-13 15:53:59,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 707 transitions. [2024-11-13 15:53:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 15:53:59,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:59,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:59,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:53:59,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:53:59,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash -889075390, now seen corresponding path program 1 times [2024-11-13 15:53:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:59,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194557458] [2024-11-13 15:53:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:59,256 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-13 15:53:59,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:59,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194557458] [2024-11-13 15:53:59,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194557458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:59,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:59,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:53:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587502021] [2024-11-13 15:53:59,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:59,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:53:59,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:59,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:53:59,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:59,258 INFO L87 Difference]: Start difference. First operand 608 states and 707 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:59,353 INFO L93 Difference]: Finished difference Result 590 states and 682 transitions. [2024-11-13 15:53:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:53:59,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-13 15:53:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:59,357 INFO L225 Difference]: With dead ends: 590 [2024-11-13 15:53:59,357 INFO L226 Difference]: Without dead ends: 590 [2024-11-13 15:53:59,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:59,358 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 41 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:59,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1712 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-13 15:53:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 587. [2024-11-13 15:53:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 373 states have (on average 1.804289544235925) internal successors, (673), 582 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:53:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 679 transitions. [2024-11-13 15:53:59,380 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 679 transitions. Word has length 17 [2024-11-13 15:53:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:59,380 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 679 transitions. [2024-11-13 15:53:59,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:53:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 679 transitions. [2024-11-13 15:53:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 15:53:59,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:59,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:53:59,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:53:59,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1361240528, now seen corresponding path program 1 times [2024-11-13 15:53:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185666120] [2024-11-13 15:53:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:59,732 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-13 15:53:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:59,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185666120] [2024-11-13 15:53:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185666120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:59,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239354785] [2024-11-13 15:53:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:59,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:53:59,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:53:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:59,734 INFO L87 Difference]: Start difference. First operand 587 states and 679 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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-13 15:54:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:00,625 INFO L93 Difference]: Finished difference Result 680 states and 766 transitions. [2024-11-13 15:54:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:54:00,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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-13 15:54:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:00,628 INFO L225 Difference]: With dead ends: 680 [2024-11-13 15:54:00,628 INFO L226 Difference]: Without dead ends: 680 [2024-11-13 15:54:00,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:54:00,631 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 417 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:00,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1011 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:54:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-13 15:54:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 583. [2024-11-13 15:54:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7935656836461127) internal successors, (669), 578 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 675 transitions. [2024-11-13 15:54:00,652 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 675 transitions. Word has length 31 [2024-11-13 15:54:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:00,653 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 675 transitions. [2024-11-13 15:54:00,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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-13 15:54:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 675 transitions. [2024-11-13 15:54:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 15:54:00,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:00,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:00,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:54:00,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:00,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1027754814, now seen corresponding path program 1 times [2024-11-13 15:54:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628667042] [2024-11-13 15:54:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:00,852 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-13 15:54:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628667042] [2024-11-13 15:54:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628667042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:00,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:54:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407609954] [2024-11-13 15:54:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:00,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:54:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:54:00,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:54:00,853 INFO L87 Difference]: Start difference. First operand 583 states and 675 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:00,925 INFO L93 Difference]: Finished difference Result 583 states and 671 transitions. [2024-11-13 15:54:00,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:54:00,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-13 15:54:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:00,929 INFO L225 Difference]: With dead ends: 583 [2024-11-13 15:54:00,929 INFO L226 Difference]: Without dead ends: 583 [2024-11-13 15:54:00,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:54:00,930 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 21 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:00,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1694 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:54:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-13 15:54:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-11-13 15:54:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7828418230563003) internal successors, (665), 578 states have internal predecessors, (665), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 671 transitions. [2024-11-13 15:54:00,951 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 671 transitions. Word has length 65 [2024-11-13 15:54:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:00,952 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 671 transitions. [2024-11-13 15:54:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 671 transitions. [2024-11-13 15:54:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:54:00,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:00,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:00,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:54:00,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:00,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -675726066, now seen corresponding path program 1 times [2024-11-13 15:54:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:00,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807314367] [2024-11-13 15:54:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:01,213 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-13 15:54:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807314367] [2024-11-13 15:54:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807314367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:01,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:01,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:54:01,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150833843] [2024-11-13 15:54:01,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:01,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:54:01,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:01,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:54:01,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:54:01,218 INFO L87 Difference]: Start difference. First operand 583 states and 671 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:01,282 INFO L93 Difference]: Finished difference Result 679 states and 794 transitions. [2024-11-13 15:54:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:54:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-13 15:54:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:01,287 INFO L225 Difference]: With dead ends: 679 [2024-11-13 15:54:01,287 INFO L226 Difference]: Without dead ends: 679 [2024-11-13 15:54:01,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:54:01,289 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:01,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1152 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:54:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-13 15:54:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2024-11-13 15:54:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 469 states have (on average 1.6801705756929637) internal successors, (788), 674 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 794 transitions. [2024-11-13 15:54:01,310 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 794 transitions. Word has length 73 [2024-11-13 15:54:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:01,311 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 794 transitions. [2024-11-13 15:54:01,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 794 transitions. [2024-11-13 15:54:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 15:54:01,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:01,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:01,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:54:01,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash -150664969, now seen corresponding path program 1 times [2024-11-13 15:54:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836903031] [2024-11-13 15:54:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:02,236 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-13 15:54:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836903031] [2024-11-13 15:54:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836903031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:02,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:02,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:54:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043872030] [2024-11-13 15:54:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:02,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:54:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:54:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:54:02,238 INFO L87 Difference]: Start difference. First operand 679 states and 794 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:03,510 INFO L93 Difference]: Finished difference Result 641 states and 756 transitions. [2024-11-13 15:54:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:54:03,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-13 15:54:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:03,516 INFO L225 Difference]: With dead ends: 641 [2024-11-13 15:54:03,516 INFO L226 Difference]: Without dead ends: 641 [2024-11-13 15:54:03,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:54:03,517 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 472 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:03,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 683 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 15:54:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-13 15:54:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 601. [2024-11-13 15:54:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 429 states have (on average 1.564102564102564) internal successors, (671), 596 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-11-13 15:54:03,535 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 76 [2024-11-13 15:54:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:03,537 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-11-13 15:54:03,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:54:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-11-13 15:54:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 15:54:03,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:03,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:03,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:54:03,540 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:03,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 271151969, now seen corresponding path program 1 times [2024-11-13 15:54:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216749852] [2024-11-13 15:54:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:03,968 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-13 15:54:03,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:03,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216749852] [2024-11-13 15:54:03,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216749852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:03,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:03,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:54:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600216993] [2024-11-13 15:54:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:03,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:54:03,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:54:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:54:03,969 INFO L87 Difference]: Start difference. First operand 601 states and 677 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 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-13 15:54:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:04,776 INFO L93 Difference]: Finished difference Result 600 states and 676 transitions. [2024-11-13 15:54:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:54:04,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 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 81 [2024-11-13 15:54:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:04,779 INFO L225 Difference]: With dead ends: 600 [2024-11-13 15:54:04,779 INFO L226 Difference]: Without dead ends: 600 [2024-11-13 15:54:04,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:54:04,781 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:04,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:54:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-13 15:54:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-13 15:54:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 429 states have (on average 1.5617715617715617) internal successors, (670), 595 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-13 15:54:04,801 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 81 [2024-11-13 15:54:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:04,802 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-13 15:54:04,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 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-13 15:54:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-13 15:54:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 15:54:04,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:04,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:04,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:54:04,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:04,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash 271151970, now seen corresponding path program 1 times [2024-11-13 15:54:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:04,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691794336] [2024-11-13 15:54:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:05,491 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-13 15:54:05,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691794336] [2024-11-13 15:54:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691794336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:54:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079008632] [2024-11-13 15:54:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:05,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:54:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:54:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:54:05,495 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 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-13 15:54:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:06,373 INFO L93 Difference]: Finished difference Result 599 states and 675 transitions. [2024-11-13 15:54:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:54:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 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 81 [2024-11-13 15:54:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:06,377 INFO L225 Difference]: With dead ends: 599 [2024-11-13 15:54:06,377 INFO L226 Difference]: Without dead ends: 599 [2024-11-13 15:54:06,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:54:06,379 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:06,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1515 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:54:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-13 15:54:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2024-11-13 15:54:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 428 states have (on average 1.5630841121495327) internal successors, (669), 594 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 675 transitions. [2024-11-13 15:54:06,398 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 675 transitions. Word has length 81 [2024-11-13 15:54:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:06,398 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 675 transitions. [2024-11-13 15:54:06,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 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-13 15:54:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 675 transitions. [2024-11-13 15:54:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 15:54:06,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:06,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:06,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:54:06,403 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -150321559, now seen corresponding path program 1 times [2024-11-13 15:54:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449291568] [2024-11-13 15:54:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:07,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:07,372 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-13 15:54:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449291568] [2024-11-13 15:54:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449291568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:07,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:07,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:54:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497842368] [2024-11-13 15:54:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:07,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:54:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:54:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:54:07,376 INFO L87 Difference]: Start difference. First operand 599 states and 675 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:08,536 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2024-11-13 15:54:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:54:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-13 15:54:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:08,542 INFO L225 Difference]: With dead ends: 606 [2024-11-13 15:54:08,543 INFO L226 Difference]: Without dead ends: 606 [2024-11-13 15:54:08,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:54:08,544 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 6 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:08,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2355 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:54:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-13 15:54:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 605. [2024-11-13 15:54:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 599 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 15:54:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 685 transitions. [2024-11-13 15:54:08,566 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 685 transitions. Word has length 89 [2024-11-13 15:54:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:08,566 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 685 transitions. [2024-11-13 15:54:08,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 685 transitions. [2024-11-13 15:54:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 15:54:08,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:08,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:08,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:54:08,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:08,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash -150321560, now seen corresponding path program 1 times [2024-11-13 15:54:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200226026] [2024-11-13 15:54:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:08,966 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-13 15:54:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200226026] [2024-11-13 15:54:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200226026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:08,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:08,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:54:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138339541] [2024-11-13 15:54:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:08,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:54:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:08,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:54:08,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:54:08,968 INFO L87 Difference]: Start difference. First operand 605 states and 685 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:10,093 INFO L93 Difference]: Finished difference Result 610 states and 689 transitions. [2024-11-13 15:54:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:54:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-13 15:54:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:10,097 INFO L225 Difference]: With dead ends: 610 [2024-11-13 15:54:10,097 INFO L226 Difference]: Without dead ends: 610 [2024-11-13 15:54:10,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:54:10,098 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 9 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:10,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2326 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:54:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-13 15:54:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2024-11-13 15:54:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5588914549653579) internal successors, (675), 599 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 15:54:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2024-11-13 15:54:10,114 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 89 [2024-11-13 15:54:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:10,115 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2024-11-13 15:54:10,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2024-11-13 15:54:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 15:54:10,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:10,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:10,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:54:10,117 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:10,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 945831108, now seen corresponding path program 1 times [2024-11-13 15:54:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:10,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031642413] [2024-11-13 15:54:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:11,337 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-13 15:54:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031642413] [2024-11-13 15:54:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031642413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574720072] [2024-11-13 15:54:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:11,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:11,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:11,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:11,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:54:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:11,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 15:54:11,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:11,823 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:54:11,824 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-13 15:54:11,841 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 8 treesize of output 1 [2024-11-13 15:54:11,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:54:11,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:54:11,991 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 22 treesize of output 10 [2024-11-13 15:54:11,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:54:12,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:12,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:54:12,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:54:12,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:54:12,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:54:12,262 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-13 15:54:12,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:12,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_511 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-13 15:54:12,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574720072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:12,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:54:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-13 15:54:12,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195614695] [2024-11-13 15:54:12,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:54:12,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:54:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:12,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:54:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-13 15:54:12,425 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:54:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:15,371 INFO L93 Difference]: Finished difference Result 612 states and 691 transitions. [2024-11-13 15:54:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:54:15,372 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-11-13 15:54:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:15,374 INFO L225 Difference]: With dead ends: 612 [2024-11-13 15:54:15,374 INFO L226 Difference]: Without dead ends: 612 [2024-11-13 15:54:15,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-13 15:54:15,375 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 483 mSDsluCounter, 2067 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:15,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2394 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 15:54:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-13 15:54:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2024-11-13 15:54:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 437 states have (on average 1.5537757437070938) internal successors, (679), 602 states have internal predecessors, (679), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 686 transitions. [2024-11-13 15:54:15,391 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 686 transitions. Word has length 90 [2024-11-13 15:54:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:15,391 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 686 transitions. [2024-11-13 15:54:15,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:54:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 686 transitions. [2024-11-13 15:54:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 15:54:15,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:15,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:15,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:54:15,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 15:54:15,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:15,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 945831107, now seen corresponding path program 1 times [2024-11-13 15:54:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503735680] [2024-11-13 15:54:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:16,267 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-13 15:54:16,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:16,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503735680] [2024-11-13 15:54:16,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503735680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:16,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681791247] [2024-11-13 15:54:16,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:16,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:16,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:16,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:54:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:16,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 15:54:16,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:16,634 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:54:16,634 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-13 15:54:16,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:54:16,743 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:16,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:16,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:54:16,787 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-13 15:54:16,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:16,843 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 15:54:16,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 15:54:16,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-11-13 15:54:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681791247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:16,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:54:16,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2024-11-13 15:54:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743900038] [2024-11-13 15:54:16,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:54:16,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:54:16,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:16,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:54:16,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-13 15:54:16,854 INFO L87 Difference]: Start difference. First operand 609 states and 686 transitions. Second operand has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:54:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:18,900 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2024-11-13 15:54:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:54:18,903 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-13 15:54:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:18,906 INFO L225 Difference]: With dead ends: 611 [2024-11-13 15:54:18,906 INFO L226 Difference]: Without dead ends: 611 [2024-11-13 15:54:18,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-13 15:54:18,907 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 499 mSDsluCounter, 2758 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:18,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3083 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:54:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-13 15:54:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 602. [2024-11-13 15:54:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 432 states have (on average 1.5555555555555556) internal successors, (672), 596 states have internal predecessors, (672), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-13 15:54:18,924 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 90 [2024-11-13 15:54:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:18,925 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-13 15:54:18,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:54:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-13 15:54:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:54:18,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:18,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:18,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:54:19,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:19,130 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:19,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1421902526, now seen corresponding path program 1 times [2024-11-13 15:54:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:19,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960113890] [2024-11-13 15:54:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:19,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:20,057 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-13 15:54:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960113890] [2024-11-13 15:54:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960113890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:54:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208708460] [2024-11-13 15:54:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:54:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:54:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:54:20,061 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:21,922 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-13 15:54:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:54:21,923 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-13 15:54:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:21,926 INFO L225 Difference]: With dead ends: 615 [2024-11-13 15:54:21,926 INFO L226 Difference]: Without dead ends: 615 [2024-11-13 15:54:21,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 15:54:21,927 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 503 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:21,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2798 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:54:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-13 15:54:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2024-11-13 15:54:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.55) internal successors, (682), 604 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 689 transitions. [2024-11-13 15:54:21,945 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 689 transitions. Word has length 92 [2024-11-13 15:54:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:21,945 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 689 transitions. [2024-11-13 15:54:21,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 689 transitions. [2024-11-13 15:54:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:54:21,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:21,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:21,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:54:21,947 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:21,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1421902527, now seen corresponding path program 1 times [2024-11-13 15:54:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639564756] [2024-11-13 15:54:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:22,960 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-13 15:54:22,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:22,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639564756] [2024-11-13 15:54:22,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639564756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:22,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:22,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:54:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299500608] [2024-11-13 15:54:22,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:22,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:54:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:22,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:54:22,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:54:22,963 INFO L87 Difference]: Start difference. First operand 611 states and 689 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:24,887 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-13 15:54:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:54:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-13 15:54:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:24,891 INFO L225 Difference]: With dead ends: 614 [2024-11-13 15:54:24,891 INFO L226 Difference]: Without dead ends: 614 [2024-11-13 15:54:24,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:54:24,892 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 482 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:24,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2162 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:54:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-13 15:54:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-13 15:54:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.5477272727272726) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-13 15:54:24,909 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 92 [2024-11-13 15:54:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:24,909 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-13 15:54:24,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-13 15:54:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 15:54:24,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:24,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:24,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:54:24,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2025313661, now seen corresponding path program 1 times [2024-11-13 15:54:24,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433450132] [2024-11-13 15:54:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:25,640 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-13 15:54:25,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:25,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433450132] [2024-11-13 15:54:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433450132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:25,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359434975] [2024-11-13 15:54:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:25,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:25,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:25,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:25,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:54:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:25,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 15:54:25,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:26,053 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:54:26,053 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-13 15:54:26,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:54:26,195 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:26,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:26,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:26,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:26,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:54:26,319 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-13 15:54:26,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:26,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_894) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 15:54:26,444 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 15:54:26,445 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 33 treesize of output 32 [2024-11-13 15:54:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359434975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:26,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:54:26,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2024-11-13 15:54:26,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116115350] [2024-11-13 15:54:26,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:54:26,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:54:26,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:54:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=313, Unknown=12, NotChecked=36, Total=420 [2024-11-13 15:54:26,513 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:54:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:28,815 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-13 15:54:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:54:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-13 15:54:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:28,818 INFO L225 Difference]: With dead ends: 613 [2024-11-13 15:54:28,818 INFO L226 Difference]: Without dead ends: 613 [2024-11-13 15:54:28,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=626, Unknown=12, NotChecked=52, Total=812 [2024-11-13 15:54:28,819 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 495 mSDsluCounter, 3674 mSDsCounter, 0 mSdLazyCounter, 3033 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:28,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 3998 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3033 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:54:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-13 15:54:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2024-11-13 15:54:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 440 states have (on average 1.5454545454545454) internal successors, (680), 603 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 687 transitions. [2024-11-13 15:54:28,835 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 687 transitions. Word has length 93 [2024-11-13 15:54:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 687 transitions. [2024-11-13 15:54:28,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:54:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 687 transitions. [2024-11-13 15:54:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 15:54:28,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:28,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:28,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:54:29,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:29,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:29,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:29,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2025313660, now seen corresponding path program 1 times [2024-11-13 15:54:29,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:29,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215659243] [2024-11-13 15:54:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:30,189 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-13 15:54:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215659243] [2024-11-13 15:54:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215659243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058778644] [2024-11-13 15:54:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:30,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:30,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:30,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:54:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:30,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 15:54:30,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:30,634 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:54:30,634 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-13 15:54:30,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:54:30,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:54:30,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:30,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:54:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:54:31,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:31,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:54:31,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:54:31,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:54:31,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:54:31,157 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-13 15:54:31,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:31,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1037 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-13 15:54:31,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:54:31,478 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 84 treesize of output 88 [2024-11-13 15:54:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058778644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:31,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:54:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2024-11-13 15:54:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908352604] [2024-11-13 15:54:31,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:54:31,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 15:54:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 15:54:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=516, Unknown=7, NotChecked=46, Total=650 [2024-11-13 15:54:31,659 INFO L87 Difference]: Start difference. First operand 610 states and 687 transitions. Second operand has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:54:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:34,002 INFO L93 Difference]: Finished difference Result 612 states and 691 transitions. [2024-11-13 15:54:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:54:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-13 15:54:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:34,005 INFO L225 Difference]: With dead ends: 612 [2024-11-13 15:54:34,005 INFO L226 Difference]: Without dead ends: 612 [2024-11-13 15:54:34,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=793, Unknown=8, NotChecked=58, Total=992 [2024-11-13 15:54:34,006 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 475 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:34,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 3037 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:54:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-13 15:54:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2024-11-13 15:54:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-13 15:54:34,021 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 93 [2024-11-13 15:54:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:34,022 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-13 15:54:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:54:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-13 15:54:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 15:54:34,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:34,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:34,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:54:34,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:34,228 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1363674673, now seen corresponding path program 1 times [2024-11-13 15:54:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618128075] [2024-11-13 15:54:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:35,034 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-13 15:54:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618128075] [2024-11-13 15:54:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618128075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:35,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:54:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39555543] [2024-11-13 15:54:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:54:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:54:35,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:54:35,036 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:36,980 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-13 15:54:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:54:36,980 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-13 15:54:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:36,982 INFO L225 Difference]: With dead ends: 616 [2024-11-13 15:54:36,983 INFO L226 Difference]: Without dead ends: 616 [2024-11-13 15:54:36,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 15:54:36,984 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 508 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:36,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3369 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:54:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-13 15:54:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2024-11-13 15:54:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5417607223476297) internal successors, (683), 605 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 690 transitions. [2024-11-13 15:54:36,999 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 690 transitions. Word has length 95 [2024-11-13 15:54:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:36,999 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 690 transitions. [2024-11-13 15:54:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 690 transitions. [2024-11-13 15:54:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 15:54:37,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:37,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:54:37,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:37,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1363674672, now seen corresponding path program 1 times [2024-11-13 15:54:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059098332] [2024-11-13 15:54:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:38,061 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-13 15:54:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059098332] [2024-11-13 15:54:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059098332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:38,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:54:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752651637] [2024-11-13 15:54:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:38,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:54:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:54:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:54:38,063 INFO L87 Difference]: Start difference. First operand 612 states and 690 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:40,138 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-13 15:54:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:54:40,140 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-13 15:54:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:40,142 INFO L225 Difference]: With dead ends: 615 [2024-11-13 15:54:40,142 INFO L226 Difference]: Without dead ends: 615 [2024-11-13 15:54:40,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:54:40,144 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 482 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:40,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2165 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:54:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-13 15:54:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-13 15:54:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5395033860045146) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-13 15:54:40,159 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 95 [2024-11-13 15:54:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:40,160 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-13 15:54:40,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-13 15:54:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 15:54:40,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:40,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:40,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:54:40,165 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:40,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -418086934, now seen corresponding path program 1 times [2024-11-13 15:54:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:40,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003443592] [2024-11-13 15:54:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:40,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:40,998 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-13 15:54:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:40,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003443592] [2024-11-13 15:54:40,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003443592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:40,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754294794] [2024-11-13 15:54:40,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:40,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:41,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:41,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:54:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:41,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 15:54:41,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:41,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:54:41,449 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-13 15:54:41,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:54:41,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:41,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:41,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:41,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:41,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:41,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:41,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:54:41,738 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-13 15:54:41,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:41,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1323) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 15:54:41,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 15:54:41,906 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-13 15:54:41,906 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 57 treesize of output 56 [2024-11-13 15:54:41,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1326))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1322)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 15:54:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754294794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:41,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:54:41,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 18 [2024-11-13 15:54:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332697612] [2024-11-13 15:54:41,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:54:41,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:54:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:54:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=343, Unknown=16, NotChecked=120, Total=552 [2024-11-13 15:54:41,920 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:43,572 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-13 15:54:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:54:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-13 15:54:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:43,574 INFO L225 Difference]: With dead ends: 614 [2024-11-13 15:54:43,574 INFO L226 Difference]: Without dead ends: 614 [2024-11-13 15:54:43,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=717, Unknown=16, NotChecked=174, Total=1056 [2024-11-13 15:54:43,574 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 477 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:43,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3066 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 15:54:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-13 15:54:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-13 15:54:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 443 states have (on average 1.5372460496613995) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-13 15:54:43,583 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 96 [2024-11-13 15:54:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:43,583 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-13 15:54:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-13 15:54:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 15:54:43,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:43,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:43,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:54:43,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:43,786 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:43,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -418086933, now seen corresponding path program 1 times [2024-11-13 15:54:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:43,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783180978] [2024-11-13 15:54:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:44,749 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-13 15:54:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:44,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783180978] [2024-11-13 15:54:44,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783180978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:44,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353445344] [2024-11-13 15:54:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:44,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:44,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:54:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:45,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 15:54:45,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:45,178 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-13 15:54:45,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:54:45,186 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-13 15:54:45,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:54:45,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:45,363 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 31 treesize of output 32 [2024-11-13 15:54:45,446 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 15:54:45,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 41 [2024-11-13 15:54:45,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:54:45,668 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 15:54:45,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2024-11-13 15:54:45,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 15:54:45,687 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 51 treesize of output 32 [2024-11-13 15:54:45,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-13 15:54:45,764 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 34 treesize of output 16 [2024-11-13 15:54:45,805 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-13 15:54:45,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:46,265 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 891 treesize of output 855 [2024-11-13 15:54:46,286 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 643 treesize of output 635 [2024-11-13 15:54:46,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 635 treesize of output 627 [2024-11-13 15:54:46,315 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 627 treesize of output 619 [2024-11-13 15:54:46,328 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 619 treesize of output 611 [2024-11-13 15:54:46,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1484 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 15:54:46,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353445344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:46,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:54:46,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-13 15:54:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344551680] [2024-11-13 15:54:46,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:54:46,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 15:54:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 15:54:46,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=764, Unknown=1, NotChecked=56, Total=930 [2024-11-13 15:54:46,533 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:54:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:50,189 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-13 15:54:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:54:50,189 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-13 15:54:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:50,191 INFO L225 Difference]: With dead ends: 613 [2024-11-13 15:54:50,191 INFO L226 Difference]: Without dead ends: 613 [2024-11-13 15:54:50,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=1146, Unknown=1, NotChecked=70, Total=1406 [2024-11-13 15:54:50,192 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 496 mSDsluCounter, 4153 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 4479 SdHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:50,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 4479 Invalid, 4160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 15:54:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-13 15:54:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 598. [2024-11-13 15:54:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 432 states have (on average 1.5462962962962963) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:54:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-11-13 15:54:50,202 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 96 [2024-11-13 15:54:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:50,203 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-11-13 15:54:50,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:54:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-11-13 15:54:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 15:54:50,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:50,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:50,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 15:54:50,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:50,409 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:50,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash 864090181, now seen corresponding path program 1 times [2024-11-13 15:54:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473568426] [2024-11-13 15:54:50,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:51,243 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-13 15:54:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:51,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473568426] [2024-11-13 15:54:51,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473568426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:51,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 15:54:51,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330901877] [2024-11-13 15:54:51,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:51,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:54:51,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:51,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:54:51,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:54:51,245 INFO L87 Difference]: Start difference. First operand 598 states and 674 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:53,216 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-13 15:54:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:54:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-13 15:54:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:53,219 INFO L225 Difference]: With dead ends: 617 [2024-11-13 15:54:53,219 INFO L226 Difference]: Without dead ends: 617 [2024-11-13 15:54:53,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-13 15:54:53,220 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 485 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:53,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 3372 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 15:54:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-13 15:54:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-11-13 15:54:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.5336322869955157) internal successors, (684), 606 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-11-13 15:54:53,228 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 98 [2024-11-13 15:54:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:53,228 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-11-13 15:54:53,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-11-13 15:54:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 15:54:53,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:53,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:53,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:54:53,230 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:53,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash 864090182, now seen corresponding path program 1 times [2024-11-13 15:54:53,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:53,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382140647] [2024-11-13 15:54:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:53,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:54,278 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-13 15:54:54,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382140647] [2024-11-13 15:54:54,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382140647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:54:54,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:54:54,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:54:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414379989] [2024-11-13 15:54:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:54,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:54:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:54:54,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:54:54,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:54:54,281 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:54:55,598 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-13 15:54:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:54:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-13 15:54:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:54:55,600 INFO L225 Difference]: With dead ends: 616 [2024-11-13 15:54:55,600 INFO L226 Difference]: Without dead ends: 616 [2024-11-13 15:54:55,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:54:55,601 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 484 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:54:55,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1657 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 15:54:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-13 15:54:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-13 15:54:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.531390134529148) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:54:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-13 15:54:55,612 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 98 [2024-11-13 15:54:55,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:54:55,613 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-13 15:54:55,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:54:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-13 15:54:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 15:54:55,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:54:55,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:54:55,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:54:55,618 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:54:55,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:54:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash 177928266, now seen corresponding path program 1 times [2024-11-13 15:54:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:54:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64275981] [2024-11-13 15:54:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:54:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:54:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:56,394 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-13 15:54:56,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:54:56,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64275981] [2024-11-13 15:54:56,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64275981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:56,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980872601] [2024-11-13 15:54:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:54:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:54:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:54:56,397 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:54:56,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:54:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:54:56,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 15:54:56,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:54:56,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:54:56,795 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-13 15:54:56,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:54:56,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:56,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:56,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:56,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:57,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:57,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:57,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:54:57,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:54:57,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:54:57,107 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-13 15:54:57,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:57,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 15:54:57,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 15:55:01,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 15:55:01,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 15:55:01,303 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-13 15:55:01,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-13 15:55:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980872601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:01,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:55:01,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 20 [2024-11-13 15:55:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850824798] [2024-11-13 15:55:01,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:01,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 15:55:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 15:55:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=448, Unknown=27, NotChecked=188, Total=756 [2024-11-13 15:55:01,381 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:04,086 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-13 15:55:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:55:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-13 15:55:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:04,089 INFO L225 Difference]: With dead ends: 615 [2024-11-13 15:55:04,089 INFO L226 Difference]: Without dead ends: 615 [2024-11-13 15:55:04,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=183, Invalid=926, Unknown=29, NotChecked=268, Total=1406 [2024-11-13 15:55:04,089 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 491 mSDsluCounter, 3681 mSDsCounter, 0 mSdLazyCounter, 3043 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 4003 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:04,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 4003 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 15:55:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-13 15:55:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-13 15:55:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 446 states have (on average 1.5291479820627802) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:55:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-13 15:55:04,098 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 99 [2024-11-13 15:55:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:04,098 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-13 15:55:04,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-13 15:55:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 15:55:04,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:04,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:04,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:55:04,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:04,299 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:04,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 177928267, now seen corresponding path program 1 times [2024-11-13 15:55:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742258785] [2024-11-13 15:55:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:05,546 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-13 15:55:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742258785] [2024-11-13 15:55:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742258785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529713821] [2024-11-13 15:55:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:05,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:05,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:05,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:05,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:55:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:05,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 15:55:05,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:06,024 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-13 15:55:06,039 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:55:06,040 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-13 15:55:06,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:55:06,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:55:06,248 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 22 treesize of output 10 [2024-11-13 15:55:06,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:55:06,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:06,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:55:06,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:06,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:06,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:55:06,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:06,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:06,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:55:06,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:06,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:06,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:55:06,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:06,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:55:06,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:55:06,839 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-13 15:55:06,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:06,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1961 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:55:06,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1961 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-13 15:55:07,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1958))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 15:55:07,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1956) .cse0 v_ArrVal_1959) (select (select (store .cse1 .cse0 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1958))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1956) .cse3 v_ArrVal_1959) .cse4 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 15:55:09,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1966))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1958))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967) .cse0 v_ArrVal_1956) .cse1 v_ArrVal_1959) .cse2 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1966))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1957))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967) .cse7 v_ArrVal_1956) .cse8 v_ArrVal_1959) (select (select (store .cse9 .cse8 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-13 15:55:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529713821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:09,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:55:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-13 15:55:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062116073] [2024-11-13 15:55:09,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:09,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 15:55:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:09,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 15:55:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=686, Unknown=22, NotChecked=290, Total=1122 [2024-11-13 15:55:09,224 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:55:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:13,936 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-13 15:55:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:55:13,936 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-13 15:55:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:13,938 INFO L225 Difference]: With dead ends: 614 [2024-11-13 15:55:13,938 INFO L226 Difference]: Without dead ends: 614 [2024-11-13 15:55:13,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=206, Invalid=1124, Unknown=22, NotChecked=370, Total=1722 [2024-11-13 15:55:13,939 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 496 mSDsluCounter, 3771 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 4554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:13,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 4095 Invalid, 4554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-13 15:55:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-13 15:55:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2024-11-13 15:55:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 432 states have (on average 1.5416666666666667) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:55:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-11-13 15:55:13,946 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 99 [2024-11-13 15:55:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:13,947 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-11-13 15:55:13,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:55:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-11-13 15:55:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 15:55:13,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:13,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:13,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:55:14,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 15:55:14,152 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:14,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash 523907079, now seen corresponding path program 1 times [2024-11-13 15:55:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983679447] [2024-11-13 15:55:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:15,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:15,177 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-13 15:55:15,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:15,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983679447] [2024-11-13 15:55:15,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983679447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:15,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:15,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:55:15,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444764464] [2024-11-13 15:55:15,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:15,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:55:15,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:15,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:55:15,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:55:15,179 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:17,081 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-13 15:55:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:55:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-13 15:55:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:17,083 INFO L225 Difference]: With dead ends: 619 [2024-11-13 15:55:17,083 INFO L226 Difference]: Without dead ends: 619 [2024-11-13 15:55:17,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-13 15:55:17,084 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 504 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:17,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2791 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 15:55:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-13 15:55:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-13 15:55:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5244444444444445) internal successors, (686), 608 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:55:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-11-13 15:55:17,096 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 102 [2024-11-13 15:55:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-11-13 15:55:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-11-13 15:55:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 15:55:17,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:17,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:17,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:55:17,098 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 523907080, now seen corresponding path program 1 times [2024-11-13 15:55:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764907624] [2024-11-13 15:55:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:18,684 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-13 15:55:18,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:18,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764907624] [2024-11-13 15:55:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764907624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:18,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:18,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 15:55:18,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645073967] [2024-11-13 15:55:18,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:18,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:55:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:18,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:55:18,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:55:18,687 INFO L87 Difference]: Start difference. First operand 615 states and 693 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:21,511 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-13 15:55:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:55:21,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-13 15:55:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:21,513 INFO L225 Difference]: With dead ends: 618 [2024-11-13 15:55:21,513 INFO L226 Difference]: Without dead ends: 618 [2024-11-13 15:55:21,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 15:55:21,514 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 488 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:21,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2188 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 15:55:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-13 15:55:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-13 15:55:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5222222222222221) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:55:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-11-13 15:55:21,522 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 102 [2024-11-13 15:55:21,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:21,523 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-11-13 15:55:21,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-11-13 15:55:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:55:21,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:21,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:21,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:55:21,524 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:21,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash -644176500, now seen corresponding path program 1 times [2024-11-13 15:55:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074347126] [2024-11-13 15:55:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:22,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:22,759 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-13 15:55:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074347126] [2024-11-13 15:55:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074347126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486632986] [2024-11-13 15:55:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:22,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:22,762 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:22,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:55:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:23,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 15:55:23,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:23,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:55:23,221 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-13 15:55:23,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:55:23,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:23,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:55:23,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:23,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:55:23,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:23,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:55:23,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:23,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:55:23,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:23,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:55:23,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:55:23,757 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 15:55:23,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-13 15:55:23,760 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-13 15:55:23,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:24,728 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-13 15:55:24,728 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 597 treesize of output 794 [2024-11-13 15:55:24,760 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2308))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2301)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2302)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2303)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2304)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 15:55:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486632986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:24,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:55:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 23 [2024-11-13 15:55:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117291968] [2024-11-13 15:55:24,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 15:55:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 15:55:24,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=931, Unknown=46, NotChecked=64, Total=1190 [2024-11-13 15:55:24,763 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:55:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:28,677 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-13 15:55:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:55:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-13 15:55:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:28,680 INFO L225 Difference]: With dead ends: 617 [2024-11-13 15:55:28,680 INFO L226 Difference]: Without dead ends: 617 [2024-11-13 15:55:28,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=276, Invalid=1662, Unknown=46, NotChecked=86, Total=2070 [2024-11-13 15:55:28,681 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 472 mSDsluCounter, 4872 mSDsCounter, 0 mSdLazyCounter, 3958 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 5193 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:28,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 5193 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3958 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-13 15:55:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-13 15:55:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-13 15:55:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 450 states have (on average 1.52) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:55:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-13 15:55:28,690 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 103 [2024-11-13 15:55:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:28,691 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-13 15:55:28,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:55:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-13 15:55:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:55:28,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:28,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:28,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:55:28,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:28,892 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -644176499, now seen corresponding path program 1 times [2024-11-13 15:55:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114006917] [2024-11-13 15:55:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:30,555 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-13 15:55:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114006917] [2024-11-13 15:55:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114006917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323076936] [2024-11-13 15:55:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:30,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:30,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:55:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:30,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 15:55:30,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:31,040 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:55:31,041 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-13 15:55:31,049 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 8 treesize of output 1 [2024-11-13 15:55:31,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:55:31,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:55:31,160 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 22 treesize of output 10 [2024-11-13 15:55:31,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:55:31,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:31,402 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 73 treesize of output 66 [2024-11-13 15:55:31,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:31,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:31,545 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 73 treesize of output 66 [2024-11-13 15:55:31,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:31,666 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:31,666 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 73 treesize of output 66 [2024-11-13 15:55:31,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:31,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:31,790 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 73 treesize of output 66 [2024-11-13 15:55:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:31,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:31,913 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 73 treesize of output 66 [2024-11-13 15:55:31,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:31,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-13 15:55:31,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:55:31,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:55:31,970 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-13 15:55:31,986 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:55:31,987 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-13 15:55:31,991 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-13 15:55:31,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:34,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2491))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2489) .cse1 v_ArrVal_2492) .cse2 v_ArrVal_2493) (select (select (store .cse3 .cse2 v_ArrVal_2494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2496))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2490 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (or (forall ((v_ArrVal_2497 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2491))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2494))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2489) .cse6 v_ArrVal_2492) .cse7 v_ArrVal_2493) .cse8 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2497) (select (select (store .cse9 .cse8 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2024-11-13 15:55:34,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:34,544 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 604 treesize of output 622 [2024-11-13 15:55:34,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_7| |c_ULTIMATE.start_main_#t~mem51#1.base|) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2497 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2502))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2491))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2494))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2503) .cse0 v_ArrVal_2489) .cse1 v_ArrVal_2492) .cse2 v_ArrVal_2493) .cse3 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2497) (select (select (store .cse5 .cse3 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_19))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_16))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_25))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_18) .cse9 v_prenex_20) .cse10 v_prenex_24) .cse11 v_prenex_23) (select (select (store .cse12 .cse11 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_21))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-13 15:55:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323076936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:34,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:55:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 25 [2024-11-13 15:55:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230860719] [2024-11-13 15:55:34,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:34,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 15:55:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 15:55:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1063, Unknown=52, NotChecked=138, Total=1406 [2024-11-13 15:55:34,982 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:55:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:40,903 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-13 15:55:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 15:55:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-13 15:55:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:40,905 INFO L225 Difference]: With dead ends: 616 [2024-11-13 15:55:40,905 INFO L226 Difference]: Without dead ends: 616 [2024-11-13 15:55:40,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=292, Invalid=2111, Unknown=55, NotChecked=194, Total=2652 [2024-11-13 15:55:40,906 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 478 mSDsluCounter, 3416 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 4375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:40,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 3735 Invalid, 4375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-13 15:55:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-13 15:55:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 594. [2024-11-13 15:55:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 432 states have (on average 1.537037037037037) internal successors, (664), 588 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:55:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2024-11-13 15:55:40,928 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 103 [2024-11-13 15:55:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:40,928 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2024-11-13 15:55:40,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:55:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2024-11-13 15:55:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 15:55:40,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:40,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:40,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:55:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-13 15:55:41,130 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash -194727620, now seen corresponding path program 1 times [2024-11-13 15:55:41,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:41,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818420530] [2024-11-13 15:55:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:41,841 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-13 15:55:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818420530] [2024-11-13 15:55:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818420530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:41,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 15:55:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365568371] [2024-11-13 15:55:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:41,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:55:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:41,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:55:41,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:55:41,843 INFO L87 Difference]: Start difference. First operand 594 states and 670 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:44,538 INFO L93 Difference]: Finished difference Result 620 states and 699 transitions. [2024-11-13 15:55:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:55:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-13 15:55:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:44,540 INFO L225 Difference]: With dead ends: 620 [2024-11-13 15:55:44,540 INFO L226 Difference]: Without dead ends: 620 [2024-11-13 15:55:44,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-13 15:55:44,541 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 506 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 3230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 4282 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:44,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 4282 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3230 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 15:55:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-13 15:55:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 616. [2024-11-13 15:55:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 453 states have (on average 1.5165562913907285) internal successors, (687), 609 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:55:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 694 transitions. [2024-11-13 15:55:44,551 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 694 transitions. Word has length 105 [2024-11-13 15:55:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:44,551 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 694 transitions. [2024-11-13 15:55:44,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 694 transitions. [2024-11-13 15:55:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 15:55:44,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:44,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:44,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 15:55:44,553 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:44,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -194727619, now seen corresponding path program 1 times [2024-11-13 15:55:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:44,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160723412] [2024-11-13 15:55:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:45,970 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-13 15:55:45,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160723412] [2024-11-13 15:55:45,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160723412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:45,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:45,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 15:55:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455080697] [2024-11-13 15:55:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:45,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:55:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:55:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:55:45,971 INFO L87 Difference]: Start difference. First operand 616 states and 694 transitions. Second operand has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:48,553 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-13 15:55:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:55:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-13 15:55:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:48,556 INFO L225 Difference]: With dead ends: 619 [2024-11-13 15:55:48,556 INFO L226 Difference]: Without dead ends: 619 [2024-11-13 15:55:48,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-13 15:55:48,556 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 486 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 2431 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 15:55:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-13 15:55:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-13 15:55:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 453 states have (on average 1.5143487858719646) internal successors, (686), 609 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:55:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 693 transitions. [2024-11-13 15:55:48,562 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 693 transitions. Word has length 105 [2024-11-13 15:55:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:48,563 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 693 transitions. [2024-11-13 15:55:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 18 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 693 transitions. [2024-11-13 15:55:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 15:55:48,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:48,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:48,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 15:55:48,564 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -747597417, now seen corresponding path program 1 times [2024-11-13 15:55:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:48,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343686189] [2024-11-13 15:55:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:49,465 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-13 15:55:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343686189] [2024-11-13 15:55:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343686189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921763429] [2024-11-13 15:55:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:49,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:49,470 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:49,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:55:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:49,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 15:55:49,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:50,009 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:55:50,009 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-13 15:55:50,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:55:50,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:50,083 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 31 treesize of output 32 [2024-11-13 15:55:50,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:50,166 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 31 treesize of output 32 [2024-11-13 15:55:50,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:50,248 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 31 treesize of output 32 [2024-11-13 15:55:50,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:50,335 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 31 treesize of output 32 [2024-11-13 15:55:50,412 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:50,413 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 31 treesize of output 32 [2024-11-13 15:55:50,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:50,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 15:55:50,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:55:50,575 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-13 15:55:50,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:50,603 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 15:55:50,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 15:55:50,735 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2864 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2864) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 15:55:50,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2861 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 15:55:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921763429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:51,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:55:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 22 [2024-11-13 15:55:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438482031] [2024-11-13 15:55:51,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:55:51,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 15:55:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:55:51,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 15:55:51,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=602, Unknown=26, NotChecked=102, Total=812 [2024-11-13 15:55:51,061 INFO L87 Difference]: Start difference. First operand 616 states and 693 transitions. Second operand has 23 states, 21 states have (on average 6.142857142857143) internal successors, (129), 22 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:54,388 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-13 15:55:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:55:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.142857142857143) internal successors, (129), 22 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-13 15:55:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:54,390 INFO L225 Difference]: With dead ends: 618 [2024-11-13 15:55:54,390 INFO L226 Difference]: Without dead ends: 618 [2024-11-13 15:55:54,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=1152, Unknown=26, NotChecked=142, Total=1482 [2024-11-13 15:55:54,391 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 477 mSDsluCounter, 4008 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:54,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 4331 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 15:55:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-13 15:55:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-13 15:55:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 453 states have (on average 1.5121412803532008) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:55:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-11-13 15:55:54,397 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 106 [2024-11-13 15:55:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:54,398 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-11-13 15:55:54,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.142857142857143) internal successors, (129), 22 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:55:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-11-13 15:55:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 15:55:54,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:54,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:54,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 15:55:54,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 15:55:54,599 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:55:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash -747597416, now seen corresponding path program 1 times [2024-11-13 15:55:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:55:54,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567060658] [2024-11-13 15:55:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:55:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:55:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:56,007 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-13 15:55:56,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:55:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567060658] [2024-11-13 15:55:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567060658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:55:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40096120] [2024-11-13 15:55:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:56,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:55:56,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:55:56,009 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:55:56,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:55:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:56,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 15:55:56,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:56,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:55:56,483 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-13 15:55:56,494 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 8 treesize of output 1 [2024-11-13 15:55:56,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:55:56,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:55:56,662 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 22 treesize of output 10 [2024-11-13 15:55:56,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:55:56,916 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:56,916 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 73 treesize of output 66 [2024-11-13 15:55:56,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:57,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:57,102 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 73 treesize of output 66 [2024-11-13 15:55:57,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:57,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:57,244 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 73 treesize of output 66 [2024-11-13 15:55:57,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:57,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:57,388 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 73 treesize of output 66 [2024-11-13 15:55:57,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:57,574 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:57,574 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 73 treesize of output 66 [2024-11-13 15:55:57,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:57,749 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-13 15:55:57,749 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 17 treesize of output 17 [2024-11-13 15:55:57,781 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-13 15:55:57,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-13 15:55:57,886 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:55:57,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:55:57,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:55:57,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:55:57,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:55:57,989 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-13 15:55:57,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:55:58,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3071 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3070 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:55:58,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0))) (forall ((v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3070 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3068) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int))) (or (forall ((v_ArrVal_3069 Int) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3071 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3067))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3068) .cse2 v_ArrVal_3070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3069) (select (select (store .cse3 .cse2 v_ArrVal_3071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0))))))) is different from false [2024-11-13 15:55:58,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3070 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3065))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3066) .cse0 v_ArrVal_3068) (select (select (store .cse1 .cse0 v_ArrVal_3067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3070))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0)))) (forall ((v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3066 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int))) (or (forall ((v_ArrVal_3069 Int) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3071 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3065))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_3067))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3066) .cse3 v_ArrVal_3068) .cse4 v_ArrVal_3070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3069) (select (select (store .cse5 .cse4 v_ArrVal_3071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0)))))) is different from false [2024-11-13 15:56:11,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0))) (forall ((v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3061 (Array Int Int)) (v_ArrVal_3062 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3062))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3063))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3065))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3061) .cse0 v_ArrVal_3064) .cse1 v_ArrVal_3066) .cse2 v_ArrVal_3068) (select (select (store .cse3 .cse2 v_ArrVal_3067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3070))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3066 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3061 (Array Int Int)) (v_ArrVal_3062 (Array Int Int))) (or (forall ((v_ArrVal_3069 Int) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3071 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3062))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3063))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3065))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3067))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3061) .cse7 v_ArrVal_3064) .cse8 v_ArrVal_3066) .cse9 v_ArrVal_3068) .cse10 v_ArrVal_3070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3069) (select (select (store .cse11 .cse10 v_ArrVal_3071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0)))))) is different from false [2024-11-13 15:56:43,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:56:43,199 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 1180 treesize of output 1198 [2024-11-13 15:56:47,779 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int)) (or (forall ((v_ArrVal_3069 Int) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3071 (Array Int Int)) (v_ArrVal_3061 (Array Int Int)) (v_ArrVal_3062 (Array Int Int)) (v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3076 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3077))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3062))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3063))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3065))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3067))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3076) .cse0 v_ArrVal_3061) .cse1 v_ArrVal_3064) .cse2 v_ArrVal_3066) .cse3 v_ArrVal_3068) .cse4 v_ArrVal_3070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3069) (select (select (store .cse6 .cse4 v_ArrVal_3071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_11| |c_ULTIMATE.start_main_#t~mem51#1.base|))) (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_37 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_30))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_37))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_26))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_29))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_28) .cse11 v_prenex_36) .cse12 v_prenex_27) .cse13 v_prenex_31) .cse14 v_prenex_34) (select (select (store .cse15 .cse14 v_prenex_33) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_35))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-11-13 15:56:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40096120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:56:47,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:56:47,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2024-11-13 15:56:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430401011] [2024-11-13 15:56:47,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:56:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 15:56:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:56:47,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 15:56:47,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1544, Unknown=47, NotChecked=430, Total=2256 [2024-11-13 15:56:47,818 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 34 states, 31 states have (on average 4.741935483870968) internal successors, (147), 32 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:57:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:39,047 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-13 15:57:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:57:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 4.741935483870968) internal successors, (147), 32 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2024-11-13 15:57:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:39,051 INFO L225 Difference]: With dead ends: 617 [2024-11-13 15:57:39,051 INFO L226 Difference]: Without dead ends: 617 [2024-11-13 15:57:39,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=416, Invalid=2748, Unknown=48, NotChecked=570, Total=3782 [2024-11-13 15:57:39,052 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 477 mSDsluCounter, 5863 mSDsCounter, 0 mSdLazyCounter, 7234 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 6182 SdHoareTripleChecker+Invalid, 7253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:39,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 6182 Invalid, 7253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 7234 Invalid, 0 Unknown, 0 Unchecked, 47.6s Time] [2024-11-13 15:57:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-13 15:57:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 592. [2024-11-13 15:57:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 432 states have (on average 1.5324074074074074) internal successors, (662), 586 states have internal predecessors, (662), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:57:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 668 transitions. [2024-11-13 15:57:39,059 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 668 transitions. Word has length 106 [2024-11-13 15:57:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:39,059 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 668 transitions. [2024-11-13 15:57:39,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 4.741935483870968) internal successors, (147), 32 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:57:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 668 transitions. [2024-11-13 15:57:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 15:57:39,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:39,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:39,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 15:57:39,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 15:57:39,261 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:57:39,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1370931982, now seen corresponding path program 1 times [2024-11-13 15:57:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:39,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505217960] [2024-11-13 15:57:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:57:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:57:41,773 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-13 15:57:41,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:57:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505217960] [2024-11-13 15:57:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505217960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:57:41,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:57:41,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 15:57:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339427721] [2024-11-13 15:57:41,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:57:41,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:57:41,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:57:41,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:57:41,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:57:41,775 INFO L87 Difference]: Start difference. First operand 592 states and 668 transitions. Second operand has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:57:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:57:59,734 INFO L93 Difference]: Finished difference Result 643 states and 724 transitions. [2024-11-13 15:57:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:57:59,735 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-13 15:57:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:57:59,736 INFO L225 Difference]: With dead ends: 643 [2024-11-13 15:57:59,736 INFO L226 Difference]: Without dead ends: 643 [2024-11-13 15:57:59,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-13 15:57:59,737 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 534 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:57:59,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 3477 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-11-13 15:57:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-13 15:57:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 617. [2024-11-13 15:57:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 456 states have (on average 1.5087719298245614) internal successors, (688), 610 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:57:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 695 transitions. [2024-11-13 15:57:59,744 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 695 transitions. Word has length 108 [2024-11-13 15:57:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:57:59,744 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 695 transitions. [2024-11-13 15:57:59,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:57:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 695 transitions. [2024-11-13 15:57:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 15:57:59,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:57:59,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:57:59,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 15:57:59,745 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:57:59,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:57:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1370931983, now seen corresponding path program 1 times [2024-11-13 15:57:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:57:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762991663] [2024-11-13 15:57:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:57:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:57:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:58:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:02,701 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-13 15:58:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:58:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762991663] [2024-11-13 15:58:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762991663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:58:02,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:58:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 15:58:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804056267] [2024-11-13 15:58:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:58:02,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:58:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:58:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:58:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:58:02,703 INFO L87 Difference]: Start difference. First operand 617 states and 695 transitions. Second operand has 17 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:58:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:58:20,748 INFO L93 Difference]: Finished difference Result 642 states and 723 transitions. [2024-11-13 15:58:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:58:20,748 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-13 15:58:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:58:20,750 INFO L225 Difference]: With dead ends: 642 [2024-11-13 15:58:20,750 INFO L226 Difference]: Without dead ends: 642 [2024-11-13 15:58:20,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-13 15:58:20,750 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 549 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 2614 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:58:20,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 2960 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2614 Invalid, 0 Unknown, 0 Unchecked, 16.6s Time] [2024-11-13 15:58:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-13 15:58:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 617. [2024-11-13 15:58:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 456 states have (on average 1.506578947368421) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:58:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-11-13 15:58:20,757 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 108 [2024-11-13 15:58:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:58:20,757 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-11-13 15:58:20,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:58:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-11-13 15:58:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 15:58:20,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:20,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:58:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 15:58:20,758 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:58:20,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2026389715, now seen corresponding path program 1 times [2024-11-13 15:58:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:58:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813533654] [2024-11-13 15:58:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:58:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:58:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:58:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:58:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813533654] [2024-11-13 15:58:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813533654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:58:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:58:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:58:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770499359] [2024-11-13 15:58:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:58:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:58:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:58:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:58:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:58:22,421 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:58:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:58:35,214 INFO L93 Difference]: Finished difference Result 633 states and 712 transitions. [2024-11-13 15:58:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:58:35,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-13 15:58:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:58:35,217 INFO L225 Difference]: With dead ends: 633 [2024-11-13 15:58:35,217 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 15:58:35,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:58:35,218 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 978 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:58:35,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 2480 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2024-11-13 15:58:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 15:58:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 616. [2024-11-13 15:58:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 456 states have (on average 1.5043859649122806) internal successors, (686), 609 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:58:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 693 transitions. [2024-11-13 15:58:35,227 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 693 transitions. Word has length 109 [2024-11-13 15:58:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:58:35,228 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 693 transitions. [2024-11-13 15:58:35,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:58:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 693 transitions. [2024-11-13 15:58:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 15:58:35,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:35,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:58:35,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 15:58:35,229 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:58:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2026389716, now seen corresponding path program 1 times [2024-11-13 15:58:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:58:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740097756] [2024-11-13 15:58:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:58:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:58:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:39,157 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-13 15:58:39,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:58:39,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740097756] [2024-11-13 15:58:39,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740097756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:58:39,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809554369] [2024-11-13 15:58:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:58:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:58:39,160 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:58:39,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 15:58:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:39,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 15:58:39,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:58:42,062 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:58:42,062 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-13 15:58:42,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:58:42,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:58:42,763 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 19 treesize of output 7 [2024-11-13 15:58:43,583 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_53| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_53| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_53| 0))) is different from true [2024-11-13 15:58:43,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:58:43,679 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2024-11-13 15:58:44,616 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 15:58:44,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-13 15:58:45,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:58:45,366 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 31 treesize of output 32 [2024-11-13 15:58:45,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:58:45,850 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 31 treesize of output 32 [2024-11-13 15:58:46,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:58:46,351 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 31 treesize of output 32 [2024-11-13 15:58:46,934 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:58:46,934 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 51 treesize of output 48 [2024-11-13 15:58:46,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:58:47,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:58:47,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-13 15:58:47,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-13 15:58:48,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-13 15:58:48,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-13 15:58:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-13 15:58:48,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:58:49,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:58:49,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-13 15:58:49,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3568 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem59#1.base|)) (forall ((v_prenex_38 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_38) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (forall ((v_ArrVal_3569 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 15:58:49,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_38 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_38) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 41 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3569 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3568 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0))))) is different from false [2024-11-13 15:58:50,476 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 640 treesize of output 598 [2024-11-13 15:58:50,502 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 232 treesize of output 224 [2024-11-13 15:58:50,522 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 224 treesize of output 220 [2024-11-13 15:58:50,545 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 220 treesize of output 216 [2024-11-13 15:58:50,567 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 216 treesize of output 208 [2024-11-13 15:58:51,075 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3565 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-13 15:58:51,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3565 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 15:58:51,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3564))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 15:58:51,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3564))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 15:58:56,062 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3562 (Array Int Int)) (v_ArrVal_3563 (Array Int Int)) (v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3562))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3563)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3564)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 15:58:56,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3562 (Array Int Int)) (v_ArrVal_3563 (Array Int Int)) (v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3562))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3563)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3564)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 15:58:57,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809554369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:58:57,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:58:57,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2024-11-13 15:58:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692947902] [2024-11-13 15:58:57,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:58:57,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-13 15:58:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:58:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 15:58:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1788, Unknown=25, NotChecked=846, Total=2862 [2024-11-13 15:58:57,323 INFO L87 Difference]: Start difference. First operand 616 states and 693 transitions. Second operand has 39 states, 36 states have (on average 5.888888888888889) internal successors, (212), 38 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:59:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:59:33,701 INFO L93 Difference]: Finished difference Result 641 states and 723 transitions. [2024-11-13 15:59:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 15:59:33,702 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 5.888888888888889) internal successors, (212), 38 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2024-11-13 15:59:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:59:33,704 INFO L225 Difference]: With dead ends: 641 [2024-11-13 15:59:33,704 INFO L226 Difference]: Without dead ends: 641 [2024-11-13 15:59:33,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=421, Invalid=3372, Unknown=25, NotChecked=1152, Total=4970 [2024-11-13 15:59:33,705 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1524 mSDsluCounter, 5031 mSDsCounter, 0 mSdLazyCounter, 4861 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 5347 SdHoareTripleChecker+Invalid, 5497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 4861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:59:33,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 5347 Invalid, 5497 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 4861 Invalid, 0 Unknown, 564 Unchecked, 31.6s Time] [2024-11-13 15:59:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-13 15:59:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 590. [2024-11-13 15:59:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 432 states have (on average 1.5277777777777777) internal successors, (660), 584 states have internal predecessors, (660), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:59:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 666 transitions. [2024-11-13 15:59:33,714 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 666 transitions. Word has length 109 [2024-11-13 15:59:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:59:33,714 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 666 transitions. [2024-11-13 15:59:33,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 5.888888888888889) internal successors, (212), 38 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:59:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 666 transitions. [2024-11-13 15:59:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 15:59:33,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:33,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:59:33,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 15:59:33,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 15:59:33,916 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:59:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash 591320464, now seen corresponding path program 1 times [2024-11-13 15:59:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:59:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341853919] [2024-11-13 15:59:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:59:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:59:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:34,250 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-13 15:59:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:59:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341853919] [2024-11-13 15:59:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341853919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:59:34,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:59:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:59:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584557968] [2024-11-13 15:59:34,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:59:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:59:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:59:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:59:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:59:34,252 INFO L87 Difference]: Start difference. First operand 590 states and 666 transitions. Second operand has 6 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:59:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:59:39,115 INFO L93 Difference]: Finished difference Result 609 states and 688 transitions. [2024-11-13 15:59:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:59:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2024-11-13 15:59:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:59:39,119 INFO L225 Difference]: With dead ends: 609 [2024-11-13 15:59:39,119 INFO L226 Difference]: Without dead ends: 609 [2024-11-13 15:59:39,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:59:39,119 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 22 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:59:39,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1936 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-13 15:59:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-13 15:59:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 589. [2024-11-13 15:59:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 432 states have (on average 1.525462962962963) internal successors, (659), 583 states have internal predecessors, (659), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:59:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 665 transitions. [2024-11-13 15:59:39,130 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 665 transitions. Word has length 111 [2024-11-13 15:59:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:59:39,130 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 665 transitions. [2024-11-13 15:59:39,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:59:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 665 transitions. [2024-11-13 15:59:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 15:59:39,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:39,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:59:39,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 15:59:39,132 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:59:39,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash 591320465, now seen corresponding path program 1 times [2024-11-13 15:59:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:59:39,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853343514] [2024-11-13 15:59:39,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:59:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:59:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:42,711 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-13 15:59:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:59:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853343514] [2024-11-13 15:59:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853343514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:59:42,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:59:42,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 15:59:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487097790] [2024-11-13 15:59:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:59:42,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:59:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:59:42,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:59:42,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:59:42,713 INFO L87 Difference]: Start difference. First operand 589 states and 665 transitions. Second operand has 19 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:00:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:00:04,945 INFO L93 Difference]: Finished difference Result 637 states and 718 transitions. [2024-11-13 16:00:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:00:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2024-11-13 16:00:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:00:04,948 INFO L225 Difference]: With dead ends: 637 [2024-11-13 16:00:04,948 INFO L226 Difference]: Without dead ends: 637 [2024-11-13 16:00:04,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-13 16:00:04,949 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 556 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:00:04,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 3831 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 20.6s Time] [2024-11-13 16:00:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-13 16:00:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 617. [2024-11-13 16:00:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 459 states have (on average 1.4967320261437909) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:00:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-11-13 16:00:04,957 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 111 [2024-11-13 16:00:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:00:04,957 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-11-13 16:00:04,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:00:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-11-13 16:00:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 16:00:04,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:00:04,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:00:04,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 16:00:04,959 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:00:04,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:00:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1883650644, now seen corresponding path program 1 times [2024-11-13 16:00:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:00:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254883407] [2024-11-13 16:00:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:00:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:00:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:00:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:08,976 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-13 16:00:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:00:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254883407] [2024-11-13 16:00:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254883407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:00:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846259488] [2024-11-13 16:00:08,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:00:08,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:00:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:00:08,980 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:00:08,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 16:00:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:09,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 16:00:09,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:00:10,256 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:00:10,257 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-13 16:00:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:00:11,422 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:00:11,422 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 31 treesize of output 32 [2024-11-13 16:00:11,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:00:11,779 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 31 treesize of output 32 [2024-11-13 16:00:12,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:00:12,141 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 31 treesize of output 32 [2024-11-13 16:00:12,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:00:12,512 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 31 treesize of output 32 [2024-11-13 16:00:12,895 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:00:12,895 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 31 treesize of output 32 [2024-11-13 16:00:13,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:00:13,315 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 31 treesize of output 32 [2024-11-13 16:00:13,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:00:13,722 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 31 treesize of output 32 [2024-11-13 16:00:14,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-13 16:00:14,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-13 16:00:14,820 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-13 16:00:14,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:00:15,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:00:15,223 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 37 treesize of output 41 [2024-11-13 16:00:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:00:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846259488] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:00:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:00:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20, 17] total 36 [2024-11-13 16:00:15,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029268891] [2024-11-13 16:00:15,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:00:15,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:00:15,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:00:15,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:00:15,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2024-11-13 16:00:15,759 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:00:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:00:19,744 INFO L93 Difference]: Finished difference Result 616 states and 693 transitions. [2024-11-13 16:00:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:00:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-13 16:00:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:00:19,748 INFO L225 Difference]: With dead ends: 616 [2024-11-13 16:00:19,748 INFO L226 Difference]: Without dead ends: 616 [2024-11-13 16:00:19,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 16:00:19,749 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 4 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:00:19,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1573 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-13 16:00:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-13 16:00:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 588. [2024-11-13 16:00:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 432 states have (on average 1.5231481481481481) internal successors, (658), 582 states have internal predecessors, (658), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:00:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 664 transitions. [2024-11-13 16:00:19,759 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 664 transitions. Word has length 112 [2024-11-13 16:00:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:00:19,759 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 664 transitions. [2024-11-13 16:00:19,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:00:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 664 transitions. [2024-11-13 16:00:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 16:00:19,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:00:19,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:00:19,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 16:00:19,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-13 16:00:19,961 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:00:19,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:00:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1151065874, now seen corresponding path program 1 times [2024-11-13 16:00:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:00:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583373429] [2024-11-13 16:00:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:00:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:00:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:00:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:23,240 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-13 16:00:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:00:23,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583373429] [2024-11-13 16:00:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583373429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:00:23,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:00:23,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 16:00:23,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103512006] [2024-11-13 16:00:23,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:00:23,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 16:00:23,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:00:23,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 16:00:23,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:00:23,243 INFO L87 Difference]: Start difference. First operand 588 states and 664 transitions. Second operand has 20 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:00:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:00:38,653 INFO L93 Difference]: Finished difference Result 636 states and 717 transitions. [2024-11-13 16:00:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 16:00:38,653 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-13 16:00:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:00:38,655 INFO L225 Difference]: With dead ends: 636 [2024-11-13 16:00:38,655 INFO L226 Difference]: Without dead ends: 636 [2024-11-13 16:00:38,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 16:00:38,656 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 555 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:00:38,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 2851 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2024-11-13 16:00:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-13 16:00:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 617. [2024-11-13 16:00:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 460 states have (on average 1.4934782608695651) internal successors, (687), 610 states have internal predecessors, (687), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:00:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 696 transitions. [2024-11-13 16:00:38,667 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 696 transitions. Word has length 112 [2024-11-13 16:00:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:00:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 696 transitions. [2024-11-13 16:00:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:00:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 696 transitions. [2024-11-13 16:00:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 16:00:38,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:00:38,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:00:38,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 16:00:38,669 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:00:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:00:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1151065875, now seen corresponding path program 1 times [2024-11-13 16:00:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:00:38,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314768310] [2024-11-13 16:00:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:00:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:00:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:00:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:43,608 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-13 16:00:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:00:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314768310] [2024-11-13 16:00:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314768310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:00:43,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:00:43,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 16:00:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650696172] [2024-11-13 16:00:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:00:43,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 16:00:43,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:00:43,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 16:00:43,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:00:43,610 INFO L87 Difference]: Start difference. First operand 617 states and 696 transitions. Second operand has 20 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:01:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:01:08,463 INFO L93 Difference]: Finished difference Result 635 states and 716 transitions. [2024-11-13 16:01:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 16:01:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-13 16:01:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:01:08,465 INFO L225 Difference]: With dead ends: 635 [2024-11-13 16:01:08,465 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 16:01:08,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 16:01:08,466 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 534 mSDsluCounter, 3621 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 3661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:01:08,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 3938 Invalid, 3661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 22.7s Time] [2024-11-13 16:01:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 16:01:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 617. [2024-11-13 16:01:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 459 states have (on average 1.4945533769063182) internal successors, (686), 610 states have internal predecessors, (686), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:01:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 695 transitions. [2024-11-13 16:01:08,475 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 695 transitions. Word has length 112 [2024-11-13 16:01:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:01:08,475 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 695 transitions. [2024-11-13 16:01:08,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:01:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 695 transitions. [2024-11-13 16:01:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:01:08,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:01:08,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:01:08,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 16:01:08,477 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:01:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:01:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1736372823, now seen corresponding path program 1 times [2024-11-13 16:01:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:01:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458805432] [2024-11-13 16:01:08,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:01:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:01:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:01:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:01:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:01:13,036 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-13 16:01:13,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:01:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458805432] [2024-11-13 16:01:13,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458805432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:01:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257511319] [2024-11-13 16:01:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:01:13,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:01:13,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:01:13,038 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:01:13,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 16:01:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:01:13,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 16:01:13,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:01:14,294 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:01:14,295 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-13 16:01:14,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:01:14,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:01:15,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:15,189 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 51 treesize of output 48 [2024-11-13 16:01:15,203 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 20 treesize of output 1 [2024-11-13 16:01:15,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:15,558 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 51 treesize of output 48 [2024-11-13 16:01:15,572 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 20 treesize of output 1 [2024-11-13 16:01:15,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:15,932 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 51 treesize of output 48 [2024-11-13 16:01:15,946 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 20 treesize of output 1 [2024-11-13 16:01:16,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:16,316 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 51 treesize of output 48 [2024-11-13 16:01:16,330 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 20 treesize of output 1 [2024-11-13 16:01:16,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:16,717 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 51 treesize of output 48 [2024-11-13 16:01:16,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 20 treesize of output 1 [2024-11-13 16:01:17,088 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-13 16:01:17,533 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 16:01:17,533 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 97 treesize of output 63 [2024-11-13 16:01:17,552 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 42 treesize of output 25 [2024-11-13 16:01:18,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:01:18,360 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 16:01:18,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-13 16:01:18,374 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 42 treesize of output 25 [2024-11-13 16:01:18,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 16:01:18,881 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 16:01:18,881 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-13 16:01:18,895 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-13 16:01:18,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:01:19,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int))) (or (not (= (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|) .cse0 (select v_ArrVal_4355 .cse0))) v_ArrVal_4355)) (= (select |c_#valid| (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4355))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) 1))) is different from false [2024-11-13 16:01:19,094 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 (select v_ArrVal_4355 .cse2))) v_ArrVal_4355)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4355))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-11-13 16:01:19,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4353 (Array Int Int)) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4353)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4355))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4355 .cse5))) v_ArrVal_4355)))))) is different from false [2024-11-13 16:01:19,298 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 272 treesize of output 184 [2024-11-13 16:01:19,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4353))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4355 .cse2))) v_ArrVal_4355)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4355))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-13 16:01:19,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4353))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4355))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4355 .cse5))) v_ArrVal_4355)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-13 16:01:20,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4350)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4351))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4353)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4355))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4355 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4355 .cse5))))))))))) is different from false [2024-11-13 16:01:20,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4351))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4353)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4355 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4355 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4355))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-13 16:01:20,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4348 (Array Int Int)) (v_ArrVal_4349 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4348)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4349) .cse9 v_ArrVal_4351))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4353)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4355 .cse2))) v_ArrVal_4355)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4355))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-13 16:01:21,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4348 (Array Int Int)) (v_ArrVal_4349 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4348))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4349) .cse10 v_ArrVal_4351))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4353))) (or (not (= v_ArrVal_4355 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4355 .cse2))))) (= (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4355))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-13 16:01:21,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4347 (Array Int Int)) (v_ArrVal_4348 (Array Int Int)) (v_ArrVal_4349 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4347)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4348))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4346) .cse9 v_ArrVal_4349) .cse10 v_ArrVal_4351))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4353))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4355 .cse2))) v_ArrVal_4355)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4355))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-13 16:01:21,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4347 (Array Int Int)) (v_ArrVal_4348 (Array Int Int)) (v_ArrVal_4349 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4347))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4348))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4346) .cse10 v_ArrVal_4349) .cse11 v_ArrVal_4351))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4353)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4355 .cse2))) v_ArrVal_4355)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4355))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-13 16:01:21,742 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (v_ArrVal_4344 (Array Int Int)) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4345 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4347 (Array Int Int)) (v_ArrVal_4348 (Array Int Int)) (v_ArrVal_4349 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4345)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4347))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4348))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4344) .cse9 v_ArrVal_4346) .cse10 v_ArrVal_4349) .cse11 v_ArrVal_4351))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4353)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4355))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4355 .cse5))) v_ArrVal_4355)))))))))))))) is different from false [2024-11-13 16:01:21,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (v_ArrVal_4344 (Array Int Int)) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4345 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4347 (Array Int Int)) (v_ArrVal_4348 (Array Int Int)) (v_ArrVal_4349 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4345))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4347))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4348))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4344) .cse10 v_ArrVal_4346) .cse11 v_ArrVal_4349) .cse12 v_ArrVal_4351))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4353)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4355))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4355 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4355 .cse5))))))))))))))))))) is different from false [2024-11-13 16:01:22,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4350 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4351 (Array Int Int)) (v_ArrVal_4353 (Array Int Int)) (v_ArrVal_4344 (Array Int Int)) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4345 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4347 (Array Int Int)) (v_ArrVal_4348 (Array Int Int)) (v_ArrVal_4349 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4361)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4345))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4347))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4348))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4350))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4362) .cse9 v_ArrVal_4344) .cse10 v_ArrVal_4346) .cse11 v_ArrVal_4349) .cse12 v_ArrVal_4351))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4353)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4355))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4355 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4355 .cse5))))))))))))))))))) is different from false [2024-11-13 16:01:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257511319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:01:22,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:01:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 33 [2024-11-13 16:01:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077381811] [2024-11-13 16:01:22,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:01:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 16:01:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:01:22,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 16:01:22,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1024, Unknown=14, NotChecked=1078, Total=2256 [2024-11-13 16:01:22,475 INFO L87 Difference]: Start difference. First operand 617 states and 695 transitions. Second operand has 34 states, 31 states have (on average 5.032258064516129) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:01:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:01:44,409 INFO L93 Difference]: Finished difference Result 633 states and 714 transitions. [2024-11-13 16:01:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 16:01:44,410 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.032258064516129) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-13 16:01:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:01:44,412 INFO L225 Difference]: With dead ends: 633 [2024-11-13 16:01:44,412 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 16:01:44,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=258, Invalid=2040, Unknown=14, NotChecked=1470, Total=3782 [2024-11-13 16:01:44,413 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 547 mSDsluCounter, 3499 mSDsCounter, 0 mSdLazyCounter, 3065 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 3818 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3065 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:01:44,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 3818 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3065 Invalid, 2 Unknown, 0 Unchecked, 19.0s Time] [2024-11-13 16:01:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 16:01:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 616. [2024-11-13 16:01:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 459 states have (on average 1.4923747276688453) internal successors, (685), 609 states have internal predecessors, (685), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:01:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 694 transitions. [2024-11-13 16:01:44,425 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 694 transitions. Word has length 113 [2024-11-13 16:01:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:01:44,426 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 694 transitions. [2024-11-13 16:01:44,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.032258064516129) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:01:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 694 transitions. [2024-11-13 16:01:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:01:44,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:01:44,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:01:44,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 16:01:44,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-13 16:01:44,629 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:01:44,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:01:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1736372824, now seen corresponding path program 1 times [2024-11-13 16:01:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:01:44,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136428790] [2024-11-13 16:01:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:01:44,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:01:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:01:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:01:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:01:49,634 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-13 16:01:49,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:01:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136428790] [2024-11-13 16:01:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136428790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:01:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63960902] [2024-11-13 16:01:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:01:49,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:01:49,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:01:49,636 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:01:49,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 16:01:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:01:50,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-13 16:01:50,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:01:50,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:01:50,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:01:51,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:01:51,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:01:51,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:51,779 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 51 treesize of output 48 [2024-11-13 16:01:51,793 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 20 treesize of output 1 [2024-11-13 16:01:52,143 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:52,143 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 51 treesize of output 48 [2024-11-13 16:01:52,181 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 20 treesize of output 1 [2024-11-13 16:01:52,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:52,553 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 51 treesize of output 48 [2024-11-13 16:01:52,579 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 20 treesize of output 1 [2024-11-13 16:01:52,936 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:52,937 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 51 treesize of output 48 [2024-11-13 16:01:52,951 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 20 treesize of output 1 [2024-11-13 16:01:53,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:01:53,338 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 51 treesize of output 48 [2024-11-13 16:01:53,352 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 20 treesize of output 1 [2024-11-13 16:01:53,728 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-13 16:01:54,189 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 16:01:54,190 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 106 treesize of output 72 [2024-11-13 16:01:54,204 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-13 16:01:55,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:01:55,117 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 16:01:55,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-13 16:01:55,206 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-13 16:01:55,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-13 16:01:56,226 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-13 16:01:56,226 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-13 16:01:56,529 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-13 16:01:56,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:01:57,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (and (forall ((v_ArrVal_4580 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4580 .cse1)) v_ArrVal_4580)) (forall ((v_ArrVal_4579 Int)) (<= 0 (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse4 .cse1 v_ArrVal_4579)))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_4580 (Array Int Int))) (or (forall ((v_ArrVal_4579 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse4 .cse1 v_ArrVal_4579))) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4580))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select .cse5 .cse6) .cse7) 384) (select |c_#length| (select (select .cse8 .cse6) .cse7)))))) (not (= (store .cse0 .cse1 (select v_ArrVal_4580 .cse1)) v_ArrVal_4580)))))) is different from false [2024-11-13 16:01:58,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4580 (Array Int Int))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4579 Int)) (<= 0 (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse4 .cse5 v_ArrVal_4579)))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (not (= (store .cse6 .cse5 (select v_ArrVal_4580 .cse5)) v_ArrVal_4580))))))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4580 (Array Int Int))) (let ((.cse11 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4579 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse4 .cse11 v_ArrVal_4579))) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_4580))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select .cse7 .cse8) .cse9) 384) (select |c_#length| (select (select .cse10 .cse8) .cse9)))))) (not (= (store .cse6 .cse11 (select v_ArrVal_4580 .cse11)) v_ArrVal_4580))))))))))) is different from false [2024-11-13 16:01:58,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.offset|)))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse8 (select .cse7 .cse6)) (.cse10 (select .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (forall ((v_ArrVal_4580 (Array Int Int))) (let ((.cse9 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4579 Int)) (let ((.cse0 (store .cse7 .cse6 (store .cse8 .cse9 v_ArrVal_4579))) (.cse3 (store .cse5 .cse6 v_ArrVal_4580))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= v_ArrVal_4580 (store .cse10 .cse9 (select v_ArrVal_4580 .cse9))))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse11))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse11) (forall ((v_ArrVal_4580 (Array Int Int))) (let ((.cse13 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4579 Int)) (<= 0 (let ((.cse12 (store .cse7 .cse6 (store .cse8 .cse13 v_ArrVal_4579)))) (select (select .cse12 (select (select (store .cse5 .cse6 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (not (= v_ArrVal_4580 (store .cse10 .cse13 (select v_ArrVal_4580 .cse13))))))))))))) is different from false [2024-11-13 16:01:58,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 820 [2024-11-13 16:01:59,182 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| 0))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|))) (and (forall ((v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4580))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (not (= v_ArrVal_4580 (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4580 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse6))))) (forall ((v_prenex_44 Int) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse11 (+ 40 v_prenex_44))) (or (< 0 (+ (let ((.cse8 (store .cse4 .cse10 (store (select .cse4 .cse10) .cse11 v_prenex_43)))) (select (select .cse8 (select (select (store .cse9 .cse10 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_44 .cse6) (not (= v_prenex_45 (store (select .cse9 .cse10) .cse11 (select v_prenex_45 .cse11)))))))) (forall ((v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse12 (store .cse4 .cse14 (store (select .cse4 .cse14) .cse15 v_ArrVal_4579)))) (select (select .cse12 (select (select (store .cse13 .cse14 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4580 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4580 .cse15)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse6)))))))) is different from false [2024-11-13 16:02:01,100 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4573)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4572))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse5 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0)))) (or (not (= v_ArrVal_4580 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4580 .cse2)))) (< (let ((.cse3 (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_4579)))) (select (select .cse3 (select (select (store .cse0 .cse1 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4573)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4572))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse14 (+ 40 v_prenex_44)) (.cse13 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0)))) (or (< 0 (+ (let ((.cse10 (store .cse13 .cse12 (store (select .cse13 .cse12) .cse14 v_prenex_43)))) (select (select .cse10 (select (select (store .cse11 .cse12 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1)) (not (= v_prenex_45 (store (select .cse11 .cse12) .cse14 (select v_prenex_45 .cse14)))) (< v_prenex_44 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4573)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4572))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse19 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse21 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse23 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0)))) (or (not (= v_ArrVal_4580 (store (select .cse19 .cse20) .cse21 (select v_ArrVal_4580 .cse21)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse22 (store .cse19 .cse20 v_ArrVal_4580))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-13 16:02:01,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4573)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4572))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4580))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4580 .cse5)) v_ArrVal_4580)))))))) (forall ((v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse20 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4573)) (.cse16 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4572))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 0))) (.cse15 (+ 40 v_prenex_44))) (or (< 0 (+ 1 (let ((.cse12 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 (store (select .cse14 .cse13) .cse15 v_prenex_43)))) (select (select .cse11 (select (select (store .cse12 .cse13 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (< v_prenex_44 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse19 (store .cse16 .cse17 (store v_ArrVal_4572 .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse15 (select v_prenex_45 .cse15)) v_prenex_45))))))) (forall ((v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4573)) (.cse26 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4572))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse24 (store .cse30 .cse27 (store (select .cse30 .cse27) .cse28 0)))) (or (< (let ((.cse22 (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store .cse24 .cse23 (store (select .cse24 .cse23) .cse25 v_ArrVal_4579)))) (select (select .cse21 (select (select (store .cse22 .cse23 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= (store (let ((.cse29 (store .cse26 .cse27 (store v_ArrVal_4572 .cse28 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse25 (select v_ArrVal_4580 .cse25)) v_ArrVal_4580)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-13 16:02:05,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4570))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4571) .cse12 v_ArrVal_4573)) (.cse2 (store .cse11 .cse12 v_ArrVal_4572))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (+ 40 v_prenex_44)) (.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= v_prenex_45 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4572 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_45 .cse5)))) (< 0 (+ (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse5 v_prenex_43)))) (select (select .cse6 (select (select (store .cse7 .cse8 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_44 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4570))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4571) .cse24 v_ArrVal_4573)) (.cse18 (store .cse23 .cse24 v_ArrVal_4572))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse22 .cse19 (store (select .cse22 .cse19) .cse20 0))) (.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse15 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse13 .cse16 (store (select .cse13 .cse16) .cse17 v_ArrVal_4579)))) (select (select .cse14 (select (select (store .cse15 .cse16 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= v_ArrVal_4580 (store (let ((.cse21 (store .cse18 .cse19 (store v_ArrVal_4572 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse17 (select v_ArrVal_4580 .cse17))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4570))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4571) .cse35 v_ArrVal_4573)) (.cse33 (store .cse34 .cse35 v_ArrVal_4572))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse28 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 0))) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse29 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse25 (store .cse26 .cse27 v_ArrVal_4580))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse28 .cse27 (store (select .cse28 .cse27) .cse29 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4580 (store (select .cse26 .cse27) .cse29 (select v_ArrVal_4580 .cse29)))))))))))))) is different from false [2024-11-13 16:02:07,935 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4570))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4571) .cse12 v_ArrVal_4573)) (.cse6 (store .cse11 .cse12 v_ArrVal_4572))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (+ 40 v_prenex_44)) (.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0)))) (or (< 0 (+ (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_prenex_43)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1)) (not (= v_prenex_45 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4572 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_prenex_45 .cse5)))) (< v_prenex_44 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4570))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4571) .cse24 v_ArrVal_4573)) (.cse22 (store .cse23 .cse24 v_ArrVal_4572))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse15 (store .cse22 .cse20 (store (select .cse22 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse18 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse17 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0)))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse14 (store .cse15 .cse16 v_ArrVal_4580))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse17 .cse16 (store (select .cse17 .cse16) .cse18 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= v_ArrVal_4580 (store (select .cse15 .cse16) .cse18 (select v_ArrVal_4580 .cse18)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4570))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4571) .cse36 v_ArrVal_4573)) (.cse30 (store .cse35 .cse36 v_ArrVal_4572))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store .cse34 .cse31 (store (select .cse34 .cse31) .cse32 0))) (.cse29 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse26 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse25 (store .cse28 .cse27 (store (select .cse28 .cse27) .cse29 v_ArrVal_4579)))) (select (select .cse25 (select (select (store .cse26 .cse27 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4580 (store (let ((.cse33 (store .cse30 .cse31 (store v_ArrVal_4572 .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse29 (select v_ArrVal_4580 .cse29)))))))))))))) is different from false [2024-11-13 16:02:41,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4568))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4570))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4569) .cse13 v_ArrVal_4571) .cse12 v_ArrVal_4573)) (.cse6 (store .cse11 .cse12 v_ArrVal_4572))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4579)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4580 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4572 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4580 .cse5))))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4568))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4570))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4569) .cse27 v_ArrVal_4571) .cse26 v_ArrVal_4573)) (.cse20 (store .cse25 .cse26 v_ArrVal_4572))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse18 (store .cse24 .cse21 (store (select .cse24 .cse21) .cse22 0))) (.cse19 (+ 40 v_prenex_44))) (or (< 0 (+ (let ((.cse16 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse15 (store .cse18 .cse17 (store (select .cse18 .cse17) .cse19 v_prenex_43)))) (select (select .cse15 (select (select (store .cse16 .cse17 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1)) (< v_prenex_44 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_45 (store (let ((.cse23 (store .cse20 .cse21 (store v_ArrVal_4572 .cse22 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse19 (select v_prenex_45 .cse19))))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4568))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4570))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4569) .cse40 v_ArrVal_4571) .cse39 v_ArrVal_4573)) (.cse37 (store .cse38 .cse39 v_ArrVal_4572))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse36 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse30 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse33 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0)))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse29 (store .cse30 .cse31 v_ArrVal_4580))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse32 .cse31 (store (select .cse32 .cse31) .cse33 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= v_ArrVal_4580 (store (select .cse30 .cse31) .cse33 (select v_ArrVal_4580 .cse33)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-13 16:03:24,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4568))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4570))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4569) .cse14 v_ArrVal_4571) .cse12 v_ArrVal_4573)) (.cse2 (store .cse11 .cse12 v_ArrVal_4572))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4580 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4572 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4580 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse8 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse6 .cse9 (store (select .cse6 .cse9) .cse5 v_ArrVal_4579)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4568))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse29 .cse28 v_ArrVal_4570))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4569) .cse28 v_ArrVal_4571) .cse27 v_ArrVal_4573)) (.cse21 (store .cse26 .cse27 v_ArrVal_4572))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (+ 40 v_prenex_44)) (.cse19 (store .cse25 .cse22 (store (select .cse25 .cse22) .cse23 0)))) (or (< 0 (+ (let ((.cse17 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_prenex_43)))) (select (select .cse16 (select (select (store .cse17 .cse18 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_45 (store (let ((.cse24 (store .cse21 .cse22 (store v_ArrVal_4572 .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse20 (select v_prenex_45 .cse20)))) (< v_prenex_44 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4568))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4570))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4569) .cse41 v_ArrVal_4571) .cse40 v_ArrVal_4573)) (.cse38 (store .cse39 .cse40 v_ArrVal_4572))) (let ((.cse36 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse37 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse38 .cse36 (store (select .cse38 .cse36) .cse37 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse34 (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 0)))) (or (not (= (store (select .cse30 .cse31) .cse32 (select v_ArrVal_4580 .cse32)) v_ArrVal_4580)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse33 (store .cse30 .cse31 v_ArrVal_4580))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse34 .cse31 (store (select .cse34 .cse31) .cse32 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-13 16:03:25,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4567))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4568))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4570))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4566) .cse12 v_ArrVal_4569) .cse13 v_ArrVal_4571) .cse11 v_ArrVal_4573)) (.cse9 (store .cse10 .cse11 v_ArrVal_4572))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4580))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4580 (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4580 .cse5)))))))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4567))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_4568))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse30 .cse29 v_ArrVal_4570))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4566) .cse28 v_ArrVal_4569) .cse29 v_ArrVal_4571) .cse27 v_ArrVal_4573)) (.cse17 (store .cse26 .cse27 v_ArrVal_4572))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse24 (store .cse25 .cse18 (store (select .cse25 .cse18) .cse19 0)))) (or (not (= (store (let ((.cse16 (store .cse17 .cse18 (store v_ArrVal_4572 .cse19 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse20 (select v_ArrVal_4580 .cse20)) v_ArrVal_4580)) (< (let ((.cse22 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store .cse24 .cse23 (store (select .cse24 .cse23) .cse20 v_ArrVal_4579)))) (select (select .cse21 (select (select (store .cse22 .cse23 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4567))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4568))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4570))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4566) .cse44 v_ArrVal_4569) .cse45 v_ArrVal_4571) .cse43 v_ArrVal_4573)) (.cse37 (store .cse42 .cse43 v_ArrVal_4572))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse39 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse36 (+ 40 v_prenex_44)) (.cse35 (store .cse41 .cse38 (store (select .cse41 .cse38) .cse39 0)))) (or (< 0 (+ (let ((.cse33 (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse35 .cse34 (store (select .cse35 .cse34) .cse36 v_prenex_43)))) (select (select .cse32 (select (select (store .cse33 .cse34 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_45 (store (let ((.cse40 (store .cse37 .cse38 (store v_ArrVal_4572 .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse36 (select v_prenex_45 .cse36)))) (< v_prenex_44 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-13 16:03:25,879 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_prenex_44 Int) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4567))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4568))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4570))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4566) .cse14 v_ArrVal_4569) .cse15 v_ArrVal_4571) .cse12 v_ArrVal_4573)) (.cse2 (store .cse11 .cse12 v_ArrVal_4572))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (+ 40 v_prenex_44)) (.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4572 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_45 .cse5)) v_prenex_45)) (< 0 (+ (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse5 v_prenex_43)))) (select (select .cse6 (select (select (store .cse7 .cse8 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_44 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4567))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4568))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4570))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4566) .cse29 v_ArrVal_4569) .cse30 v_ArrVal_4571) .cse28 v_ArrVal_4573)) (.cse26 (store .cse27 .cse28 v_ArrVal_4572))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse18 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 0))) (.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4580 (store (select .cse19 .cse20) .cse21 (select v_ArrVal_4580 .cse21)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse22 (store .cse19 .cse20 v_ArrVal_4580))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse20 (store (select .cse18 .cse20) .cse21 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4579 Int) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4580 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4567))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4568))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4570))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4566) .cse45 v_ArrVal_4569) .cse46 v_ArrVal_4571) .cse44 v_ArrVal_4573)) (.cse34 (store .cse43 .cse44 v_ArrVal_4572))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse41 (store .cse42 .cse35 (store (select .cse42 .cse35) .cse36 0)))) (or (not (= (store (let ((.cse33 (store .cse34 .cse35 (store v_ArrVal_4572 .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse37 (select v_ArrVal_4580 .cse37)) v_ArrVal_4580)) (< (let ((.cse39 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse41 .cse40 (store (select .cse41 .cse40) .cse37 v_ArrVal_4579)))) (select (select .cse38 (select (select (store .cse39 .cse40 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-13 16:03:27,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4580 (Array Int Int)) (v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4585 (Array Int Int)) (v_ArrVal_4586 (Array Int Int)) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4586))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4567))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4568))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4570))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4585) .cse13 v_ArrVal_4566) .cse14 v_ArrVal_4569) .cse15 v_ArrVal_4571) .cse12 v_ArrVal_4573)) (.cse3 (store .cse11 .cse12 v_ArrVal_4572))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse2 (store .cse3 .cse4 (store v_ArrVal_4572 .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse6 (select v_ArrVal_4580 .cse6)) v_ArrVal_4580)) (< (let ((.cse8 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse6 v_ArrVal_4579)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))))))) (forall ((v_prenex_44 Int) (v_prenex_43 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4585 (Array Int Int)) (v_ArrVal_4586 (Array Int Int)) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4586))) (let ((.cse31 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse35 (store .cse36 .cse31 v_ArrVal_4567))) (let ((.cse32 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse35 .cse32 v_ArrVal_4568))) (let ((.cse33 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse34 .cse33 v_ArrVal_4570))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4585) .cse31 v_ArrVal_4566) .cse32 v_ArrVal_4569) .cse33 v_ArrVal_4571) .cse30 v_ArrVal_4573)) (.cse21 (store .cse29 .cse30 v_ArrVal_4572))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse28 .cse22 (store (select .cse28 .cse22) .cse23 0))) (.cse24 (+ 40 v_prenex_44))) (or (< v_prenex_44 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse20 (store .cse21 .cse22 (store v_ArrVal_4572 .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse24 (select v_prenex_45 .cse24)) v_prenex_45)) (< 0 (+ 1 (let ((.cse26 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse19 .cse27 (store (select .cse19 .cse27) .cse24 v_prenex_43)))) (select (select .cse25 (select (select (store .cse26 .cse27 v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))))))) (forall ((v_ArrVal_4579 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4580 (Array Int Int)) (v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4585 (Array Int Int)) (v_ArrVal_4586 (Array Int Int)) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4567 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4569 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4586))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4567))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4568))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4570))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4585) .cse48 v_ArrVal_4566) .cse49 v_ArrVal_4569) .cse50 v_ArrVal_4571) .cse47 v_ArrVal_4573)) (.cse45 (store .cse46 .cse47 v_ArrVal_4572))) (let ((.cse43 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse44 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse45 .cse43 (store (select .cse45 .cse43) .cse44 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse37 (store .cse42 .cse43 (store (select .cse42 .cse43) .cse44 0))) (.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse41 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse38 (store .cse39 .cse40 v_ArrVal_4580))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse37 .cse40 (store (select .cse37 .cse40) .cse41 v_ArrVal_4579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4580 (store (select .cse39 .cse40) .cse41 (select v_ArrVal_4580 .cse41)))))))))))))))))))) is different from false [2024-11-13 16:03:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63960902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:03:27,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:03:27,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2024-11-13 16:03:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767032118] [2024-11-13 16:03:27,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:03:27,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 16:03:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 16:03:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1419, Unknown=13, NotChecked=1144, Total=2756 [2024-11-13 16:03:27,584 INFO L87 Difference]: Start difference. First operand 616 states and 694 transitions. Second operand has 36 states, 33 states have (on average 4.757575757575758) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:04:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:04,755 INFO L93 Difference]: Finished difference Result 632 states and 713 transitions. [2024-11-13 16:04:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 16:04:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 4.757575757575758) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-13 16:04:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:04,758 INFO L225 Difference]: With dead ends: 632 [2024-11-13 16:04:04,758 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 16:04:04,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 93.8s TimeCoverageRelationStatistics Valid=332, Invalid=2677, Unknown=13, NotChecked=1534, Total=4556 [2024-11-13 16:04:04,759 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 528 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 4991 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4991 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:04,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 5415 Invalid, 5017 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 4991 Invalid, 2 Unknown, 0 Unchecked, 33.1s Time] [2024-11-13 16:04:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 16:04:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 586. [2024-11-13 16:04:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 431 states have (on average 1.5220417633410672) internal successors, (656), 580 states have internal predecessors, (656), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:04:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 662 transitions. [2024-11-13 16:04:04,774 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 662 transitions. Word has length 113 [2024-11-13 16:04:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:04,774 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 662 transitions. [2024-11-13 16:04:04,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 4.757575757575758) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:04:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 662 transitions. [2024-11-13 16:04:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:04:04,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:04,775 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:04:04,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 16:04:04,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-13 16:04:04,976 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:04:04,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1887399516, now seen corresponding path program 1 times [2024-11-13 16:04:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990131486] [2024-11-13 16:04:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:04:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:05,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 16:04:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:04:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990131486] [2024-11-13 16:04:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990131486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:04:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628078136] [2024-11-13 16:04:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:05,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:04:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:04:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:04:05,252 INFO L87 Difference]: Start difference. First operand 586 states and 662 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:04:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:09,296 INFO L93 Difference]: Finished difference Result 694 states and 805 transitions. [2024-11-13 16:04:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:04:09,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-11-13 16:04:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:09,299 INFO L225 Difference]: With dead ends: 694 [2024-11-13 16:04:09,299 INFO L226 Difference]: Without dead ends: 694 [2024-11-13 16:04:09,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:04:09,300 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 888 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:09,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1000 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-13 16:04:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-13 16:04:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 688. [2024-11-13 16:04:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 540 states have (on average 1.462962962962963) internal successors, (790), 682 states have internal predecessors, (790), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:04:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 796 transitions. [2024-11-13 16:04:09,311 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 796 transitions. Word has length 122 [2024-11-13 16:04:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:09,311 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 796 transitions. [2024-11-13 16:04:09,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:04:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 796 transitions. [2024-11-13 16:04:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:04:09,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:09,312 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:04:09,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-13 16:04:09,312 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:04:09,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1887399517, now seen corresponding path program 1 times [2024-11-13 16:04:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:09,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606362477] [2024-11-13 16:04:09,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:09,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:04:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 16:04:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:04:09,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606362477] [2024-11-13 16:04:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606362477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:09,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:09,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:04:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218141642] [2024-11-13 16:04:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:09,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:04:09,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:04:09,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:04:09,853 INFO L87 Difference]: Start difference. First operand 688 states and 796 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:04:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:15,471 INFO L93 Difference]: Finished difference Result 904 states and 1051 transitions. [2024-11-13 16:04:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:04:15,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-11-13 16:04:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:15,473 INFO L225 Difference]: With dead ends: 904 [2024-11-13 16:04:15,474 INFO L226 Difference]: Without dead ends: 904 [2024-11-13 16:04:15,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:04:15,474 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1344 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:15,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1144 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-13 16:04:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-11-13 16:04:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 852. [2024-11-13 16:04:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 704 states have (on average 1.4588068181818181) internal successors, (1027), 846 states have internal predecessors, (1027), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:04:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1033 transitions. [2024-11-13 16:04:15,487 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1033 transitions. Word has length 122 [2024-11-13 16:04:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:15,487 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1033 transitions. [2024-11-13 16:04:15,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:04:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1033 transitions. [2024-11-13 16:04:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 16:04:15,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:15,488 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:04:15,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-13 16:04:15,488 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:04:15,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1620156400, now seen corresponding path program 1 times [2024-11-13 16:04:15,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:15,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500110328] [2024-11-13 16:04:15,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:15,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:04:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 16:04:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:04:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500110328] [2024-11-13 16:04:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500110328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:04:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745228414] [2024-11-13 16:04:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:16,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:04:16,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:16,063 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:04:16,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 16:04:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:16,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 16:04:16,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:04:19,084 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:04:19,084 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-13 16:04:19,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:04:19,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:04:20,438 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 19 treesize of output 7 [2024-11-13 16:04:20,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:04:20,741 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-13 16:04:21,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:04:21,318 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 31 treesize of output 32 [2024-11-13 16:04:21,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:04:21,728 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 31 treesize of output 32 [2024-11-13 16:04:22,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:04:22,167 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 31 treesize of output 32 [2024-11-13 16:04:22,668 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:04:22,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:04:23,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:04:23,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:04:23,803 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 22 treesize of output 10 [2024-11-13 16:04:24,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:04:25,118 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-13 16:04:25,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:04:26,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4956) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 16:04:26,598 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 16:04:26,598 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 33 treesize of output 32 [2024-11-13 16:04:27,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4955 (Array Int Int)) (v_ArrVal_4956 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_4955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse2)))) is different from false [2024-11-13 16:04:27,177 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4954 (Array Int Int)) (v_ArrVal_4955 (Array Int Int)) (v_ArrVal_4956 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4954)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2024-11-13 16:04:33,997 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4954 (Array Int Int)) (v_ArrVal_4955 (Array Int Int)) (v_ArrVal_4956 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4953))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4954)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4955))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 16:04:34,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4954 (Array Int Int)) (v_ArrVal_4955 (Array Int Int)) (v_ArrVal_4956 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4952))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4953)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4954)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4955))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 16:04:34,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4954 (Array Int Int)) (v_ArrVal_4955 (Array Int Int)) (v_ArrVal_4956 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4952))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4953)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4954)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4955))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 16:04:35,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4950 Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4954 (Array Int Int)) (v_ArrVal_4955 (Array Int Int)) (v_ArrVal_4956 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base|) (+ 16 |c_ULTIMATE.start_main_#t~mem53#1.offset|) v_ArrVal_4950)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4952)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4953)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4954)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4955))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 16:04:36,589 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4950 Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4954 (Array Int Int)) (v_ArrVal_4955 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem53#1.offset_38| Int) (v_ArrVal_4956 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem53#1.offset_38| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (store |c_#memory_$Pointer$#1.base| .cse7 (store (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_main_#t~mem53#1.offset_38| 16) v_ArrVal_4950))))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4952)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4953)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4954)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= .cse1 (select (select (let ((.cse2 (store .cse3 .cse1 v_ArrVal_4955))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2024-11-13 16:04:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745228414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:04:37,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:04:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 19] total 23 [2024-11-13 16:04:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067033129] [2024-11-13 16:04:37,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:04:37,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 16:04:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:37,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 16:04:37,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=736, Unknown=48, NotChecked=504, Total=1406 [2024-11-13 16:04:37,422 INFO L87 Difference]: Start difference. First operand 852 states and 1033 transitions. Second operand has 23 states, 22 states have (on average 10.681818181818182) internal successors, (235), 22 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:05:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:06,835 INFO L93 Difference]: Finished difference Result 857 states and 1038 transitions. [2024-11-13 16:05:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:05:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 10.681818181818182) internal successors, (235), 22 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 123 [2024-11-13 16:05:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:06,838 INFO L225 Difference]: With dead ends: 857 [2024-11-13 16:05:06,838 INFO L226 Difference]: Without dead ends: 855 [2024-11-13 16:05:06,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=171, Invalid=1216, Unknown=51, NotChecked=632, Total=2070 [2024-11-13 16:05:06,839 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 463 mSDsluCounter, 4848 mSDsCounter, 0 mSdLazyCounter, 3733 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 5166 SdHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:06,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 5166 Invalid, 3747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3733 Invalid, 0 Unknown, 0 Unchecked, 27.4s Time] [2024-11-13 16:05:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-13 16:05:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-13 16:05:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 707 states have (on average 1.4554455445544554) internal successors, (1029), 849 states have internal predecessors, (1029), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:05:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1036 transitions. [2024-11-13 16:05:06,853 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1036 transitions. Word has length 123 [2024-11-13 16:05:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:06,853 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1036 transitions. [2024-11-13 16:05:06,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 10.681818181818182) internal successors, (235), 22 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:05:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1036 transitions. [2024-11-13 16:05:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 16:05:06,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:06,854 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:05:06,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 16:05:07,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-13 16:05:07,055 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:05:07,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash -90912338, now seen corresponding path program 1 times [2024-11-13 16:05:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:07,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512031237] [2024-11-13 16:05:07,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:05:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 16:05:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:05:07,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:07,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512031237] [2024-11-13 16:05:07,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512031237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:07,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578922749] [2024-11-13 16:05:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:07,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:05:07,990 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:05:07,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 16:05:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:08,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-13 16:05:08,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:05:08,624 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-13 16:05:12,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:05:12,202 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-13 16:05:12,235 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-13 16:05:12,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:05:13,212 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 4 [2024-11-13 16:05:14,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:14,058 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 31 treesize of output 32 [2024-11-13 16:05:14,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:14,716 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 31 treesize of output 32 [2024-11-13 16:05:15,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:15,249 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 31 treesize of output 32 [2024-11-13 16:05:15,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:15,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 16:05:16,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:16,393 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 31 treesize of output 32 [2024-11-13 16:05:16,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:05:16,885 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-13 16:05:16,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:05:16,958 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-13 16:05:17,319 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:17,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:05:18,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:18,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:05:19,077 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 16:05:19,132 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 22 treesize of output 10 [2024-11-13 16:05:21,160 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-13 16:05:21,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2024-11-13 16:05:21,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:05:21,354 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 3 case distinctions, treesize of input 18 treesize of output 36 [2024-11-13 16:05:23,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:05:23,842 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 67 treesize of output 85 [2024-11-13 16:05:24,353 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-13 16:05:24,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:05:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578922749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:26,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:05:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 26] total 31 [2024-11-13 16:05:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552430749] [2024-11-13 16:05:26,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:05:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-13 16:05:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-13 16:05:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1074, Unknown=1, NotChecked=0, Total=1190 [2024-11-13 16:05:26,313 INFO L87 Difference]: Start difference. First operand 855 states and 1036 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 29 states have internal predecessors, (239), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:06:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:24,675 INFO L93 Difference]: Finished difference Result 869 states and 1051 transitions. [2024-11-13 16:06:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 16:06:24,675 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 29 states have internal predecessors, (239), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 125 [2024-11-13 16:06:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:24,678 INFO L225 Difference]: With dead ends: 869 [2024-11-13 16:06:24,678 INFO L226 Difference]: Without dead ends: 863 [2024-11-13 16:06:24,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=271, Invalid=2697, Unknown=2, NotChecked=0, Total=2970 [2024-11-13 16:06:24,679 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 469 mSDsluCounter, 5055 mSDsCounter, 0 mSdLazyCounter, 6806 mSolverCounterSat, 23 mSolverCounterUnsat, 68 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 5300 SdHoareTripleChecker+Invalid, 6897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6806 IncrementalHoareTripleChecker+Invalid, 68 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:24,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 5300 Invalid, 6897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6806 Invalid, 68 Unknown, 0 Unchecked, 52.9s Time] [2024-11-13 16:06:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-13 16:06:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2024-11-13 16:06:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 713 states have (on average 1.453015427769986) internal successors, (1036), 854 states have internal predecessors, (1036), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:06:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1043 transitions. [2024-11-13 16:06:24,690 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1043 transitions. Word has length 125 [2024-11-13 16:06:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1043 transitions. [2024-11-13 16:06:24,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 29 states have internal predecessors, (239), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:06:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1043 transitions. [2024-11-13 16:06:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 16:06:24,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:24,692 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:06:24,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 16:06:24,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:24,892 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:06:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1974843024, now seen corresponding path program 2 times [2024-11-13 16:06:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:24,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846709482] [2024-11-13 16:06:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:06:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 16:06:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:06:25,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846709482] [2024-11-13 16:06:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846709482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306300412] [2024-11-13 16:06:25,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:06:25,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:25,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:25,761 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:25,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 16:06:26,244 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 16:06:26,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:06:26,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 16:06:26,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:26,382 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-13 16:06:26,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 16:06:29,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:06:29,976 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 54 treesize of output 38 [2024-11-13 16:06:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 16:06:31,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306300412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:31,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:06:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2024-11-13 16:06:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60147200] [2024-11-13 16:06:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:31,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:06:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:31,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:06:31,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:06:31,571 INFO L87 Difference]: Start difference. First operand 861 states and 1043 transitions. Second operand has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 16:06:33,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:06:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:39,359 INFO L93 Difference]: Finished difference Result 1187 states and 1389 transitions. [2024-11-13 16:06:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:06:39,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 127 [2024-11-13 16:06:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:39,363 INFO L225 Difference]: With dead ends: 1187 [2024-11-13 16:06:39,363 INFO L226 Difference]: Without dead ends: 1187 [2024-11-13 16:06:39,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-11-13 16:06:39,364 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 573 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:39,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 2719 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-13 16:06:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2024-11-13 16:06:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 861. [2024-11-13 16:06:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 713 states have (on average 1.4516129032258065) internal successors, (1035), 854 states have internal predecessors, (1035), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:06:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1042 transitions. [2024-11-13 16:06:39,379 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1042 transitions. Word has length 127 [2024-11-13 16:06:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:39,380 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1042 transitions. [2024-11-13 16:06:39,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 16:06:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1042 transitions. [2024-11-13 16:06:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:06:39,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:39,381 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:06:39,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 16:06:39,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-13 16:06:39,582 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 16:06:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash 936955941, now seen corresponding path program 1 times [2024-11-13 16:06:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445449880] [2024-11-13 16:06:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:06:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:06:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:06:40,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:40,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445449880] [2024-11-13 16:06:40,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445449880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043057452] [2024-11-13 16:06:40,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:40,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:40,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:40,416 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:40,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b34513de-00cb-4aa0-aabf-af0fb0ab8d1c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 16:06:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:41,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 16:06:41,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:43,673 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:06:43,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 16:06:43,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:06:43,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:06:44,517 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 19 treesize of output 7 [2024-11-13 16:06:44,837 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 22 treesize of output 10 [2024-11-13 16:06:46,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:06:46,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:06:46,692 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-11-13 16:06:46,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2024-11-13 16:06:48,464 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 16:06:48,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2024-11-13 16:06:49,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:49,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:06:50,371 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:50,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 16:06:50,386 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 20 treesize of output 1 [2024-11-13 16:06:51,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:51,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 16:06:51,222 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 20 treesize of output 1 [2024-11-13 16:06:52,268 INFO L349 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2024-11-13 16:06:52,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 38 [2024-11-13 16:06:52,743 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 16:06:52,743 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 133 treesize of output 81 [2024-11-13 16:06:52,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 67 treesize of output 48 [2024-11-13 16:06:53,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:06:53,830 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 16:06:53,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 66 [2024-11-13 16:06:53,849 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 67 treesize of output 48 [2024-11-13 16:06:54,238 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 56 treesize of output 38 [2024-11-13 16:06:55,159 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 16:06:55,159 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 21 [2024-11-13 16:06:56,073 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-13 16:06:56,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 65 [2024-11-13 16:06:57,365 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 16:06:57,365 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 24 [2024-11-13 16:06:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:06:57,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:06:58,814 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5715 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem64#1.base| v_ArrVal_5715) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 16:06:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043057452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:58,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:06:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 28] total 34 [2024-11-13 16:06:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263489037] [2024-11-13 16:06:58,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:06:58,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 16:06:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 16:06:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1187, Unknown=7, NotChecked=70, Total=1406 [2024-11-13 16:06:58,823 INFO L87 Difference]: Start difference. First operand 861 states and 1042 transitions. Second operand has 34 states, 32 states have (on average 7.625) internal successors, (244), 33 states have internal predecessors, (244), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:07:05,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:07:17,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:07:20,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]