./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_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_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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_bf736742-c404-4f3d-aa34-812ae69e079b/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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:01:17,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:01:17,165 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:01:17,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:01:17,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:01:17,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:01:17,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:01:17,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:01:17,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:01:17,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:01:17,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:01:17,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:01:17,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:01:17,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:01:17,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:01:17,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:01:17,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:01:17,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:01:17,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:01:17,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:01:17,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:01:17,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:01:17,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:01:17,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:01:17,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:01:17,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:01:17,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:01:17,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:01:17,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:01:17,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:01:17,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:01:17,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:01:17,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:01:17,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:01:17,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:01:17,198 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_bf736742-c404-4f3d-aa34-812ae69e079b/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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2024-11-13 15:01:17,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:01:17,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:01:17,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:01:17,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:01:17,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:01:17,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i Unable to find full path for "g++" [2024-11-13 15:01:19,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:01:19,836 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:01:19,840 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2024-11-13 15:01:19,863 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data/8cc8d4322/8e051fcf2f804a6a854d1f125e6aabd6/FLAGa58a4beaa [2024-11-13 15:01:19,996 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data/8cc8d4322/8e051fcf2f804a6a854d1f125e6aabd6 [2024-11-13 15:01:20,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:01:20,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:01:20,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:01:20,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:01:20,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:01:20,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:01:19" (1/1) ... [2024-11-13 15:01:20,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a050f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20, skipping insertion in model container [2024-11-13 15:01:20,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:01:19" (1/1) ... [2024-11-13 15:01:20,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:01:20,483 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:01:20,528 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:01:20,535 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:01:20,545 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:01:20,563 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:01:20,583 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:01:20,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:01:20,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:01:20,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:01:20,760 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:01:20,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20 WrapperNode [2024-11-13 15:01:20,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:01:20,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:01:20,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:01:20,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:01:20,768 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:01:20" (1/1) ... [2024-11-13 15:01:20,788 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:01:20" (1/1) ... [2024-11-13 15:01:20,835 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-13 15:01:20,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:01:20,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:01:20,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:01:20,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:01:20,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:20,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:20,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:20,926 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:01:20,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:20,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:20,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:20,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:20,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:21,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:21,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:01:21,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:01:21,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:01:21,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:01:21,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (1/1) ... [2024-11-13 15:01:21,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:01:21,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:21,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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:01:21,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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:01:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:01:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:01:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 15:01:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 15:01:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:01:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:01:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 15:01:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 15:01:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 15:01:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 15:01:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:01:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:01:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:01:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:01:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:01:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:01:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:01:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:01:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:01:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:01:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:01:21,323 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:01:21,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:01:21,330 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 15:01:21,402 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 15:01:23,449 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-13 15:01:23,452 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:01:23,489 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:01:23,489 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-13 15:01:23,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:01:23 BoogieIcfgContainer [2024-11-13 15:01:23,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:01:23,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:01:23,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:01:23,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:01:23,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:01:19" (1/3) ... [2024-11-13 15:01:23,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac4b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:01:23, skipping insertion in model container [2024-11-13 15:01:23,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:01:20" (2/3) ... [2024-11-13 15:01:23,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac4b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:01:23, skipping insertion in model container [2024-11-13 15:01:23,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:01:23" (3/3) ... [2024-11-13 15:01:23,505 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-1.i [2024-11-13 15:01:23,521 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:01:23,523 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test1-1.i that has 4 procedures, 763 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-13 15:01:23,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:01:23,611 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;@22dbef0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:01:23,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-13 15:01:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:01:23,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:23,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:01:23,631 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:01:23,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-13 15:01:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878327114] [2024-11-13 15:01:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:23,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:23,875 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:01:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:23,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878327114] [2024-11-13 15:01:23,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878327114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:23,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:23,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:01:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688931532] [2024-11-13 15:01:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:23,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:23,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:23,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:23,919 INFO L87 Difference]: Start difference. First operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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:01:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:24,760 INFO L93 Difference]: Finished difference Result 701 states and 809 transitions. [2024-11-13 15:01:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:24,763 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:01:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:24,775 INFO L225 Difference]: With dead ends: 701 [2024-11-13 15:01:24,776 INFO L226 Difference]: Without dead ends: 699 [2024-11-13 15:01:24,777 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:01:24,780 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 697 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:24,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 510 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:01:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-13 15:01:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2024-11-13 15:01:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 419 states have (on average 1.8568019093078758) internal successors, (778), 691 states have internal predecessors, (778), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 804 transitions. [2024-11-13 15:01:24,846 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 804 transitions. Word has length 5 [2024-11-13 15:01:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:24,847 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 804 transitions. [2024-11-13 15:01:24,847 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:01:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 804 transitions. [2024-11-13 15:01:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:01:24,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:24,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:01:24,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:01:24,848 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:01:24,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-13 15:01:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433394624] [2024-11-13 15:01:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:24,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:24,972 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:01:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:24,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433394624] [2024-11-13 15:01:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433394624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:01:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096249218] [2024-11-13 15:01:24,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:24,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:24,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:24,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:24,975 INFO L87 Difference]: Start difference. First operand 697 states and 804 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:01:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:25,586 INFO L93 Difference]: Finished difference Result 775 states and 888 transitions. [2024-11-13 15:01:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:25,587 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:01:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:25,591 INFO L225 Difference]: With dead ends: 775 [2024-11-13 15:01:25,591 INFO L226 Difference]: Without dead ends: 775 [2024-11-13 15:01:25,591 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:01:25,592 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 412 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:25,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 913 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:01:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-13 15:01:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 727. [2024-11-13 15:01:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 459 states have (on average 1.8453159041394336) internal successors, (847), 721 states have internal predecessors, (847), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 873 transitions. [2024-11-13 15:01:25,626 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 873 transitions. Word has length 5 [2024-11-13 15:01:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:25,626 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 873 transitions. [2024-11-13 15:01:25,630 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:01:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 873 transitions. [2024-11-13 15:01:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:01:25,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:25,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:01:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:01:25,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:25,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:25,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1423324823, now seen corresponding path program 1 times [2024-11-13 15:01:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369769882] [2024-11-13 15:01:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:25,704 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:01:25,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:25,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369769882] [2024-11-13 15:01:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369769882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:25,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:25,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:25,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860560049] [2024-11-13 15:01:25,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:25,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:25,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:25,710 INFO L87 Difference]: Start difference. First operand 727 states and 873 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:01:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:25,784 INFO L93 Difference]: Finished difference Result 1404 states and 1676 transitions. [2024-11-13 15:01:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:25,785 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:01:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:25,791 INFO L225 Difference]: With dead ends: 1404 [2024-11-13 15:01:25,791 INFO L226 Difference]: Without dead ends: 1404 [2024-11-13 15:01:25,791 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:01:25,792 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 717 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:25,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1578 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:01:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2024-11-13 15:01:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 728. [2024-11-13 15:01:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 460 states have (on average 1.8434782608695652) internal successors, (848), 722 states have internal predecessors, (848), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 874 transitions. [2024-11-13 15:01:25,824 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 874 transitions. Word has length 6 [2024-11-13 15:01:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:25,824 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 874 transitions. [2024-11-13 15:01:25,825 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:01:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 874 transitions. [2024-11-13 15:01:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:01:25,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:25,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:25,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:01:25,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:25,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610682, now seen corresponding path program 1 times [2024-11-13 15:01:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:25,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922854679] [2024-11-13 15:01:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:25,918 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:01:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922854679] [2024-11-13 15:01:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922854679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:25,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:25,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439839036] [2024-11-13 15:01:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:25,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:01:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:01:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:01:25,921 INFO L87 Difference]: Start difference. First operand 728 states and 874 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:26,704 INFO L93 Difference]: Finished difference Result 754 states and 927 transitions. [2024-11-13 15:01:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:01:26,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:01:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:26,709 INFO L225 Difference]: With dead ends: 754 [2024-11-13 15:01:26,709 INFO L226 Difference]: Without dead ends: 754 [2024-11-13 15:01:26,709 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:01:26,710 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 965 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:26,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 791 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:01:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-13 15:01:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 705. [2024-11-13 15:01:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 460 states have (on average 1.7934782608695652) internal successors, (825), 699 states have internal predecessors, (825), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 851 transitions. [2024-11-13 15:01:26,737 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 851 transitions. Word has length 11 [2024-11-13 15:01:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 851 transitions. [2024-11-13 15:01:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 851 transitions. [2024-11-13 15:01:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:01:26,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:26,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:26,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:01:26,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:26,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610681, now seen corresponding path program 1 times [2024-11-13 15:01:26,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:26,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924350340] [2024-11-13 15:01:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:26,870 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:01:26,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:26,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924350340] [2024-11-13 15:01:26,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924350340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:26,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:26,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:26,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973140537] [2024-11-13 15:01:26,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:26,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:26,872 INFO L87 Difference]: Start difference. First operand 705 states and 851 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:26,911 INFO L93 Difference]: Finished difference Result 630 states and 748 transitions. [2024-11-13 15:01:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:26,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:01:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:26,915 INFO L225 Difference]: With dead ends: 630 [2024-11-13 15:01:26,915 INFO L226 Difference]: Without dead ends: 630 [2024-11-13 15:01:26,915 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:01:26,916 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 61 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1259 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:01:26,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:01:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-13 15:01:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-13 15:01:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.818639798488665) internal successors, (722), 624 states have internal predecessors, (722), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 748 transitions. [2024-11-13 15:01:26,939 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 748 transitions. Word has length 11 [2024-11-13 15:01:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:26,939 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 748 transitions. [2024-11-13 15:01:26,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 748 transitions. [2024-11-13 15:01:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 15:01:26,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:26,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:26,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:01:26,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:26,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 614446658, now seen corresponding path program 1 times [2024-11-13 15:01:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906550905] [2024-11-13 15:01:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:27,028 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:01:27,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:27,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906550905] [2024-11-13 15:01:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906550905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:27,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:27,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:01:27,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914081615] [2024-11-13 15:01:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:27,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:01:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:27,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:01:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:01:27,030 INFO L87 Difference]: Start difference. First operand 630 states and 748 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:01:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:27,101 INFO L93 Difference]: Finished difference Result 612 states and 723 transitions. [2024-11-13 15:01:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:01:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-13 15:01:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:27,104 INFO L225 Difference]: With dead ends: 612 [2024-11-13 15:01:27,105 INFO L226 Difference]: Without dead ends: 612 [2024-11-13 15:01:27,105 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:01:27,106 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 41 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1835 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.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:27,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:01:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-13 15:01:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2024-11-13 15:01:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 383 states have (on average 1.8120104438642297) internal successors, (694), 603 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2024-11-13 15:01:27,135 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 13 [2024-11-13 15:01:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2024-11-13 15:01:27,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:01:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2024-11-13 15:01:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 15:01:27,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:27,140 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] [2024-11-13 15:01:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:01:27,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash 448345584, now seen corresponding path program 1 times [2024-11-13 15:01:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083346779] [2024-11-13 15:01:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:27,407 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:01:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083346779] [2024-11-13 15:01:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083346779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439190724] [2024-11-13 15:01:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:01:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:01:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:01:27,410 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:28,092 INFO L93 Difference]: Finished difference Result 702 states and 807 transitions. [2024-11-13 15:01:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:01:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 15:01:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:28,096 INFO L225 Difference]: With dead ends: 702 [2024-11-13 15:01:28,096 INFO L226 Difference]: Without dead ends: 702 [2024-11-13 15:01:28,096 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:01:28,097 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 417 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:28,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1136 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:01:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-13 15:01:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 605. [2024-11-13 15:01:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.8015665796344646) internal successors, (690), 599 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 716 transitions. [2024-11-13 15:01:28,117 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 716 transitions. Word has length 27 [2024-11-13 15:01:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:28,118 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 716 transitions. [2024-11-13 15:01:28,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 716 transitions. [2024-11-13 15:01:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 15:01:28,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:28,120 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] [2024-11-13 15:01:28,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:01:28,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:28,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash -234532926, now seen corresponding path program 1 times [2024-11-13 15:01:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:28,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256781841] [2024-11-13 15:01:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:28,296 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:01:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256781841] [2024-11-13 15:01:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256781841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:28,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:01:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332522831] [2024-11-13 15:01:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:28,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:01:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:01:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:01:28,299 INFO L87 Difference]: Start difference. First operand 605 states and 716 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:28,360 INFO L93 Difference]: Finished difference Result 605 states and 712 transitions. [2024-11-13 15:01:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:01:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-13 15:01:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:28,363 INFO L225 Difference]: With dead ends: 605 [2024-11-13 15:01:28,363 INFO L226 Difference]: Without dead ends: 605 [2024-11-13 15:01:28,364 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:01:28,365 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 21 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1817 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:01:28,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1817 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:01:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-13 15:01:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-13 15:01:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.7911227154046998) internal successors, (686), 599 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 712 transitions. [2024-11-13 15:01:28,384 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 712 transitions. Word has length 61 [2024-11-13 15:01:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:28,384 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 712 transitions. [2024-11-13 15:01:28,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 712 transitions. [2024-11-13 15:01:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 15:01:28,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:28,390 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] [2024-11-13 15:01:28,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:01:28,391 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:28,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2013989618, now seen corresponding path program 1 times [2024-11-13 15:01:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882118016] [2024-11-13 15:01:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:28,598 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:01:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882118016] [2024-11-13 15:01:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882118016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:28,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569290576] [2024-11-13 15:01:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:28,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:28,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:28,600 INFO L87 Difference]: Start difference. First operand 605 states and 712 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:01:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:28,653 INFO L93 Difference]: Finished difference Result 697 states and 831 transitions. [2024-11-13 15:01:28,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:28,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-13 15:01:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:28,657 INFO L225 Difference]: With dead ends: 697 [2024-11-13 15:01:28,659 INFO L226 Difference]: Without dead ends: 697 [2024-11-13 15:01:28,659 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:01:28,661 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 54 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1234 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:01:28,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1234 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:01:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-13 15:01:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-13 15:01:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 475 states have (on average 1.694736842105263) internal successors, (805), 691 states have internal predecessors, (805), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 831 transitions. [2024-11-13 15:01:28,680 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 831 transitions. Word has length 69 [2024-11-13 15:01:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:28,680 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 831 transitions. [2024-11-13 15:01:28,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:01:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 831 transitions. [2024-11-13 15:01:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:01:28,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:28,684 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] [2024-11-13 15:01:28,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:01:28,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1821260209, now seen corresponding path program 1 times [2024-11-13 15:01:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551587466] [2024-11-13 15:01:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:29,450 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:01:29,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:29,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551587466] [2024-11-13 15:01:29,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551587466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:29,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:29,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:01:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979704246] [2024-11-13 15:01:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:29,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:01:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:29,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:01:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:01:29,451 INFO L87 Difference]: Start difference. First operand 697 states and 831 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:30,464 INFO L93 Difference]: Finished difference Result 659 states and 793 transitions. [2024-11-13 15:01:30,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:01:30,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-13 15:01:30,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:30,468 INFO L225 Difference]: With dead ends: 659 [2024-11-13 15:01:30,468 INFO L226 Difference]: Without dead ends: 659 [2024-11-13 15:01:30,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:01:30,469 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 914 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:30,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 782 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:01:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-13 15:01:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 619. [2024-11-13 15:01:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 435 states have (on average 1.5816091954022988) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2024-11-13 15:01:30,491 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 72 [2024-11-13 15:01:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:30,492 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2024-11-13 15:01:30,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2024-11-13 15:01:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 15:01:30,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:30,493 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] [2024-11-13 15:01:30,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:01:30,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:30,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -840152991, now seen corresponding path program 1 times [2024-11-13 15:01:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357614345] [2024-11-13 15:01:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:30,887 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:01:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:30,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357614345] [2024-11-13 15:01:30,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357614345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:30,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:30,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:01:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696787914] [2024-11-13 15:01:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:30,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:01:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:30,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:01:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:01:30,889 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:31,566 INFO L93 Difference]: Finished difference Result 618 states and 713 transitions. [2024-11-13 15:01:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:01:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-13 15:01:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:31,569 INFO L225 Difference]: With dead ends: 618 [2024-11-13 15:01:31,570 INFO L226 Difference]: Without dead ends: 618 [2024-11-13 15:01:31,570 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:01:31,571 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 2 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:31,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1669 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:01:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-13 15:01:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-13 15:01:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 435 states have (on average 1.5793103448275863) internal successors, (687), 612 states have internal predecessors, (687), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-13 15:01:31,588 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 77 [2024-11-13 15:01:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:31,589 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-13 15:01:31,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-13 15:01:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 15:01:31,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:31,593 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] [2024-11-13 15:01:31,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:01:31,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -840152990, now seen corresponding path program 1 times [2024-11-13 15:01:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903686066] [2024-11-13 15:01:31,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:32,227 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:01:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903686066] [2024-11-13 15:01:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903686066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:32,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:01:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167980920] [2024-11-13 15:01:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:32,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:01:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:32,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:01:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:01:32,231 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:33,099 INFO L93 Difference]: Finished difference Result 617 states and 712 transitions. [2024-11-13 15:01:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:01:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-13 15:01:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:33,102 INFO L225 Difference]: With dead ends: 617 [2024-11-13 15:01:33,102 INFO L226 Difference]: Without dead ends: 617 [2024-11-13 15:01:33,103 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:01:33,103 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:33,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1676 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:01:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-13 15:01:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-13 15:01:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 434 states have (on average 1.5806451612903225) internal successors, (686), 611 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 712 transitions. [2024-11-13 15:01:33,118 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 712 transitions. Word has length 77 [2024-11-13 15:01:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:33,118 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 712 transitions. [2024-11-13 15:01:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 712 transitions. [2024-11-13 15:01:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 15:01:33,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:33,119 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] [2024-11-13 15:01:33,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:01:33,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:33,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash 628207464, now seen corresponding path program 1 times [2024-11-13 15:01:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915355024] [2024-11-13 15:01:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915355024] [2024-11-13 15:01:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915355024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:33,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:33,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:01:33,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328034573] [2024-11-13 15:01:33,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:33,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:01:33,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:33,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:01:33,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:01:33,463 INFO L87 Difference]: Start difference. First operand 617 states and 712 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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:01:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:34,519 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-13 15:01:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:01:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-13 15:01:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:34,522 INFO L225 Difference]: With dead ends: 629 [2024-11-13 15:01:34,522 INFO L226 Difference]: Without dead ends: 629 [2024-11-13 15:01:34,523 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:01:34,523 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 16 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:34,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2460 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:01:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-13 15:01:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 623. [2024-11-13 15:01:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5785876993166288) internal successors, (693), 616 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-13 15:01:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2024-11-13 15:01:34,539 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 85 [2024-11-13 15:01:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:34,539 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2024-11-13 15:01:34,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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:01:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2024-11-13 15:01:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 15:01:34,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:34,541 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] [2024-11-13 15:01:34,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:01:34,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:34,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 628207465, now seen corresponding path program 1 times [2024-11-13 15:01:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:34,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110897229] [2024-11-13 15:01:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:35,235 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:01:35,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:35,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110897229] [2024-11-13 15:01:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110897229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:01:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515767185] [2024-11-13 15:01:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:35,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:01:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:01:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:01:35,239 INFO L87 Difference]: Start difference. First operand 623 states and 722 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:01:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:36,391 INFO L93 Difference]: Finished difference Result 623 states and 721 transitions. [2024-11-13 15:01:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:01:36,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-13 15:01:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:36,395 INFO L225 Difference]: With dead ends: 623 [2024-11-13 15:01:36,396 INFO L226 Difference]: Without dead ends: 623 [2024-11-13 15:01:36,396 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:01:36,397 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 11 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:36,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2496 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:01:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-13 15:01:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-13 15:01:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5763097949886105) internal successors, (692), 616 states have internal predecessors, (692), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-13 15:01:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 721 transitions. [2024-11-13 15:01:36,414 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 721 transitions. Word has length 85 [2024-11-13 15:01:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:36,415 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 721 transitions. [2024-11-13 15:01:36,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:01:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 721 transitions. [2024-11-13 15:01:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 15:01:36,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:36,416 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] [2024-11-13 15:01:36,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:01:36,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash -744805445, now seen corresponding path program 1 times [2024-11-13 15:01:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133073454] [2024-11-13 15:01:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:37,059 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:01:37,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:37,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133073454] [2024-11-13 15:01:37,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133073454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:37,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964328563] [2024-11-13 15:01:37,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:37,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:37,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:37,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:37,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:01:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:37,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 15:01:37,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:37,363 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 15:01:37,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:01:37,540 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:01:37,557 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:01:37,666 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:01:37,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 42 treesize of output 41 [2024-11-13 15:01:37,708 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:01:37,713 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:01:37,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:37,787 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 15:01:37,787 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:01:37,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964328563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:37,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:01:37,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-13 15:01:37,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589711294] [2024-11-13 15:01:37,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:37,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:01:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:37,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:01:37,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=194, Unknown=8, NotChecked=0, Total=240 [2024-11-13 15:01:37,849 INFO L87 Difference]: Start difference. First operand 623 states and 721 transitions. Second operand has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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:01:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:40,001 INFO L93 Difference]: Finished difference Result 622 states and 720 transitions. [2024-11-13 15:01:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:01:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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 86 [2024-11-13 15:01:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:40,005 INFO L225 Difference]: With dead ends: 622 [2024-11-13 15:01:40,005 INFO L226 Difference]: Without dead ends: 622 [2024-11-13 15:01:40,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=449, Unknown=10, NotChecked=0, Total=552 [2024-11-13 15:01:40,007 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 511 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:40,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3309 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:01:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-13 15:01:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2024-11-13 15:01:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 439 states have (on average 1.5740318906605923) internal successors, (691), 615 states have internal predecessors, (691), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-13 15:01:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 720 transitions. [2024-11-13 15:01:40,024 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 720 transitions. Word has length 86 [2024-11-13 15:01:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:40,024 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 720 transitions. [2024-11-13 15:01:40,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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:01:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 720 transitions. [2024-11-13 15:01:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 15:01:40,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:40,025 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] [2024-11-13 15:01:40,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:01:40,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 15:01:40,232 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:40,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash -744805444, now seen corresponding path program 1 times [2024-11-13 15:01:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:40,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640133078] [2024-11-13 15:01:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:41,209 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:01:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640133078] [2024-11-13 15:01:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640133078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308022918] [2024-11-13 15:01:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:41,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:41,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:41,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:41,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:01:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:41,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 15:01:41,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:41,457 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 15:01:41,634 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:01:41,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:01:41,643 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:01:41,685 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:01:41,698 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:01:41,839 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:01:41,846 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:01:42,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:01:42,033 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:01:42,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:01:42,110 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:01:42,118 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:01:42,148 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:01:42,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:42,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_643) |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~mem50#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:01:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308022918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:42,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:01:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-13 15:01:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567848049] [2024-11-13 15:01:42,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:42,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:01:42,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:01:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-13 15:01:42,310 INFO L87 Difference]: Start difference. First operand 622 states and 720 transitions. Second operand has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 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:01:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:44,941 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-13 15:01:44,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:01:44,942 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 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 86 [2024-11-13 15:01:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:44,944 INFO L225 Difference]: With dead ends: 629 [2024-11-13 15:01:44,944 INFO L226 Difference]: Without dead ends: 629 [2024-11-13 15:01:44,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-13 15:01:44,945 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 513 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:44,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2927 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2933 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 15:01:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-13 15:01:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 620. [2024-11-13 15:01:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 438 states have (on average 1.5730593607305936) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:01:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-13 15:01:44,963 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 86 [2024-11-13 15:01:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:44,963 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-13 15:01:44,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 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:01:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-13 15:01:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 15:01:44,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:44,965 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] [2024-11-13 15:01:44,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:01:45,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:45,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:45,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1756652152, now seen corresponding path program 1 times [2024-11-13 15:01:45,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:45,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410568148] [2024-11-13 15:01:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:45,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:45,824 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:01:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:45,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410568148] [2024-11-13 15:01:45,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410568148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:45,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:45,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:01:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921700756] [2024-11-13 15:01:45,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:45,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:01:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:01:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:01:45,827 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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:01:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:47,863 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-13 15:01:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:01:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 88 [2024-11-13 15:01:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:47,866 INFO L225 Difference]: With dead ends: 633 [2024-11-13 15:01:47,867 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 15:01:47,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 15:01:47,868 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 526 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3914 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:47,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3914 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:01:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 15:01:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2024-11-13 15:01:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5672645739910314) internal successors, (699), 621 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:01:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 726 transitions. [2024-11-13 15:01:47,883 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 726 transitions. Word has length 88 [2024-11-13 15:01:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:47,883 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 726 transitions. [2024-11-13 15:01:47,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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:01:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 726 transitions. [2024-11-13 15:01:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 15:01:47,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:47,884 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] [2024-11-13 15:01:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:01:47,884 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:47,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1756652153, now seen corresponding path program 1 times [2024-11-13 15:01:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:47,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935343100] [2024-11-13 15:01:47,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:47,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:48,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:48,692 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:01:48,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:48,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935343100] [2024-11-13 15:01:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935343100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:48,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:01:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299591182] [2024-11-13 15:01:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:01:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:01:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:01:48,694 INFO L87 Difference]: Start difference. First operand 629 states and 726 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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:01:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:50,202 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-13 15:01:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:01:50,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 88 [2024-11-13 15:01:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:50,206 INFO L225 Difference]: With dead ends: 632 [2024-11-13 15:01:50,206 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 15:01:50,206 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:01:50,207 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 513 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:50,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1790 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 15:01:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 15:01:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-13 15:01:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5650224215246638) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:01:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-13 15:01:50,221 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 88 [2024-11-13 15:01:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:50,221 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-13 15:01:50,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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:01:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-13 15:01:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 15:01:50,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:50,223 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:01:50,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:01:50,223 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:50,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -697360059, now seen corresponding path program 1 times [2024-11-13 15:01:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:50,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769260299] [2024-11-13 15:01:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:50,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:50,871 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:01:50,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:50,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769260299] [2024-11-13 15:01:50,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769260299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:50,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669559644] [2024-11-13 15:01:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:50,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:50,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:50,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:01:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:51,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 15:01:51,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:51,128 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 15:01:51,258 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:01:51,259 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:01:51,268 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:01:51,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:01:51,364 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:01:51,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:01:51,426 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:01:51,445 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:01:51,449 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:01:51,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:51,611 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 15:01:51,612 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:01:51,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669559644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:51,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:01:51,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-13 15:01:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959877636] [2024-11-13 15:01:51,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:51,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:01:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:01:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=304, Unknown=21, NotChecked=0, Total=380 [2024-11-13 15:01:51,673 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 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:01:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:54,239 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-13 15:01:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:01:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 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 89 [2024-11-13 15:01:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:54,241 INFO L225 Difference]: With dead ends: 631 [2024-11-13 15:01:54,242 INFO L226 Difference]: Without dead ends: 631 [2024-11-13 15:01:54,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=616, Unknown=22, NotChecked=0, Total=756 [2024-11-13 15:01:54,243 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 495 mSDsluCounter, 3907 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 4265 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:54,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 4265 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 15:01:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-13 15:01:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2024-11-13 15:01:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 446 states have (on average 1.562780269058296) internal successors, (697), 620 states have internal predecessors, (697), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:01:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 724 transitions. [2024-11-13 15:01:54,257 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 724 transitions. Word has length 89 [2024-11-13 15:01:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:54,258 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 724 transitions. [2024-11-13 15:01:54,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 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:01:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 724 transitions. [2024-11-13 15:01:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 15:01:54,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:54,259 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:01:54,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:01:54,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:54,464 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:01:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -697360058, now seen corresponding path program 1 times [2024-11-13 15:01:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288914128] [2024-11-13 15:01:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:55,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:01:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:55,510 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:01:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288914128] [2024-11-13 15:01:55,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288914128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339720344] [2024-11-13 15:01:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:55,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:55,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:55,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:01:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:55,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 15:01:55,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:55,796 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 15:01:55,964 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:01:55,978 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:01:55,979 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:01:55,999 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:01:56,005 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:01:56,078 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:01:56,083 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:01:56,223 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:01:56,223 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:01:56,229 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:01:56,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:01:56,326 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:01:56,335 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:01:56,354 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:01:56,360 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:01:56,365 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:01:56,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:56,541 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_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1045 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 15:01:56,613 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050))) (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~mem50#1.base| v_ArrVal_1051) .cse1 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 15:01:56,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339720344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:56,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:01:56,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-13 15:01:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609174168] [2024-11-13 15:01:56,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:56,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:01:56,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:56,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:01:56,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=316, Unknown=12, NotChecked=74, Total=462 [2024-11-13 15:01:56,618 INFO L87 Difference]: Start difference. First operand 628 states and 724 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 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:01:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:59,977 INFO L93 Difference]: Finished difference Result 630 states and 728 transitions. [2024-11-13 15:01:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:01:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 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 89 [2024-11-13 15:01:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:59,984 INFO L225 Difference]: With dead ends: 630 [2024-11-13 15:01:59,984 INFO L226 Difference]: Without dead ends: 630 [2024-11-13 15:01:59,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=636, Unknown=13, NotChecked=106, Total=870 [2024-11-13 15:01:59,986 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 502 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 3437 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:59,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3016 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3437 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 15:01:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-13 15:02:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 618. [2024-11-13 15:02:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 438 states have (on average 1.5684931506849316) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:02:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-13 15:02:00,011 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 89 [2024-11-13 15:02:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:00,012 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-13 15:02:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 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:02:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-13 15:02:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 15:02:00,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:00,013 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] [2024-11-13 15:02:00,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:02:00,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:00,216 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:00,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1751633777, now seen corresponding path program 1 times [2024-11-13 15:02:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176048022] [2024-11-13 15:02:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:00,951 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:02:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176048022] [2024-11-13 15:02:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176048022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:02:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499304353] [2024-11-13 15:02:00,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:00,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:02:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:00,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:02:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:02:00,954 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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:02:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:02,606 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-13 15:02:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:02:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2024-11-13 15:02:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:02,609 INFO L225 Difference]: With dead ends: 634 [2024-11-13 15:02:02,610 INFO L226 Difference]: Without dead ends: 634 [2024-11-13 15:02:02,610 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:02:02,611 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 511 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:02,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2939 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 15:02:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-13 15:02:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2024-11-13 15:02:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.55902004454343) internal successors, (700), 622 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 727 transitions. [2024-11-13 15:02:02,625 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 727 transitions. Word has length 91 [2024-11-13 15:02:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:02,625 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 727 transitions. [2024-11-13 15:02:02,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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:02:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 727 transitions. [2024-11-13 15:02:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 15:02:02,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:02,626 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] [2024-11-13 15:02:02,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:02:02,627 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:02,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:02,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1751633776, now seen corresponding path program 1 times [2024-11-13 15:02:02,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:02,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212117050] [2024-11-13 15:02:02,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:02,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:03,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:03,638 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:02:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212117050] [2024-11-13 15:02:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212117050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:03,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:02:03,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800225789] [2024-11-13 15:02:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:02:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:03,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:02:03,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:02:03,641 INFO L87 Difference]: Start difference. First operand 630 states and 727 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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:02:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:05,652 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-13 15:02:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:02:05,652 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2024-11-13 15:02:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:05,655 INFO L225 Difference]: With dead ends: 633 [2024-11-13 15:02:05,655 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 15:02:05,655 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:02:05,657 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 526 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:05,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2667 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:02:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 15:02:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-13 15:02:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.556792873051225) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-13 15:02:05,669 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 91 [2024-11-13 15:02:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:05,669 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-13 15:02:05,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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:02:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-13 15:02:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:02:05,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:05,671 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:02:05,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:02:05,671 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:05,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash -296099166, now seen corresponding path program 1 times [2024-11-13 15:02:05,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:05,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754244751] [2024-11-13 15:02:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:06,440 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:02:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754244751] [2024-11-13 15:02:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754244751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:06,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598449523] [2024-11-13 15:02:06,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:06,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:06,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:06,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:06,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:02:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:06,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 15:02:06,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:06,743 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 15:02:06,887 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:02:06,887 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:02:06,897 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:02:06,990 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:06,990 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:02:07,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:07,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 42 treesize of output 41 [2024-11-13 15:02:07,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:07,133 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:02:07,150 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:02:07,153 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:02:07,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:07,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (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~mem52#1.base| v_ArrVal_1330))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 15:02:07,389 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-13 15:02:07,390 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:02:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598449523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:07,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:02:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2024-11-13 15:02:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905825876] [2024-11-13 15:02:07,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:02:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:02:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:02:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=411, Unknown=23, NotChecked=42, Total=552 [2024-11-13 15:02:07,463 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 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:02:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:09,669 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-13 15:02:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:02:09,669 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 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 92 [2024-11-13 15:02:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:09,671 INFO L225 Difference]: With dead ends: 632 [2024-11-13 15:02:09,671 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 15:02:09,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=817, Unknown=24, NotChecked=60, Total=1056 [2024-11-13 15:02:09,672 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 497 mSDsluCounter, 3898 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:09,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4255 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:02:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 15:02:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-13 15:02:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 449 states have (on average 1.55456570155902) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-13 15:02:09,684 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 92 [2024-11-13 15:02:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:09,684 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-13 15:02:09,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 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:02:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-13 15:02:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:02:09,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:09,686 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:02:09,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:02:09,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:09,887 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:09,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash -296099165, now seen corresponding path program 1 times [2024-11-13 15:02:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:09,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523149642] [2024-11-13 15:02:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:10,887 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:02:10,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:10,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523149642] [2024-11-13 15:02:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523149642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:10,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32493984] [2024-11-13 15:02:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:10,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:10,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:10,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:10,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:02:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:11,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 15:02:11,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:11,173 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 15:02:11,314 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:02:11,314 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:02:11,320 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:02:11,358 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:02:11,362 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:02:11,482 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:02:11,487 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:02:11,620 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:11,620 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:02:11,628 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:02:11,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:11,735 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:02:11,742 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:02:11,838 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:11,839 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:02:11,844 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 41 treesize of output 22 [2024-11-13 15:02:11,912 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:02:11,921 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 30 treesize of output 12 [2024-11-13 15:02:11,975 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:02:11,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:12,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1489))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1490))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0))))))) is different from false [2024-11-13 15:02:12,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse5 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1490))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse8 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))))) is different from false [2024-11-13 15:02:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32493984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:12,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:02:12,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-13 15:02:12,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361178648] [2024-11-13 15:02:12,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:02:12,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 15:02:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:12,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 15:02:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=700, Unknown=13, NotChecked=110, Total=930 [2024-11-13 15:02:12,588 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 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:02:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:15,498 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-13 15:02:15,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:02:15,498 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 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 92 [2024-11-13 15:02:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:15,500 INFO L225 Difference]: With dead ends: 631 [2024-11-13 15:02:15,500 INFO L226 Difference]: Without dead ends: 631 [2024-11-13 15:02:15,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=1076, Unknown=13, NotChecked=138, Total=1406 [2024-11-13 15:02:15,501 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 515 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:15,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 3058 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 15:02:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-13 15:02:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 616. [2024-11-13 15:02:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 438 states have (on average 1.5639269406392695) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:02:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2024-11-13 15:02:15,513 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 92 [2024-11-13 15:02:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:15,514 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2024-11-13 15:02:15,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 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:02:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2024-11-13 15:02:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 15:02:15,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:15,515 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] [2024-11-13 15:02:15,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:02:15,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:15,716 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:15,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash 931410495, now seen corresponding path program 1 times [2024-11-13 15:02:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:15,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608230751] [2024-11-13 15:02:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:16,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:16,433 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:02:16,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:16,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608230751] [2024-11-13 15:02:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608230751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:16,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:16,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 15:02:16,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506249592] [2024-11-13 15:02:16,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:16,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:02:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:02:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:02:16,435 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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:02:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:18,100 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-13 15:02:18,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:02:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2024-11-13 15:02:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:18,103 INFO L225 Difference]: With dead ends: 635 [2024-11-13 15:02:18,103 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 15:02:18,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-13 15:02:18,104 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 516 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:18,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 3287 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 15:02:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 15:02:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-13 15:02:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5508849557522124) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2024-11-13 15:02:18,116 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 94 [2024-11-13 15:02:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:18,116 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2024-11-13 15:02:18,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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:02:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2024-11-13 15:02:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 15:02:18,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:18,118 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] [2024-11-13 15:02:18,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:02:18,118 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:18,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:18,119 INFO L85 PathProgramCache]: Analyzing trace with hash 931410496, now seen corresponding path program 1 times [2024-11-13 15:02:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038008120] [2024-11-13 15:02:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:19,062 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:02:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038008120] [2024-11-13 15:02:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038008120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:02:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353627499] [2024-11-13 15:02:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:02:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:02:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:02:19,064 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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:02:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:21,303 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-13 15:02:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:02:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2024-11-13 15:02:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:21,306 INFO L225 Difference]: With dead ends: 634 [2024-11-13 15:02:21,306 INFO L226 Difference]: Without dead ends: 634 [2024-11-13 15:02:21,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:02:21,306 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 527 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:21,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2880 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:02:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-13 15:02:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-13 15:02:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5486725663716814) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-13 15:02:21,321 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 94 [2024-11-13 15:02:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:21,321 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-13 15:02:21,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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:02:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-13 15:02:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 15:02:21,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:21,323 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:02:21,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:02:21,323 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash 773186380, now seen corresponding path program 1 times [2024-11-13 15:02:21,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:21,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546725265] [2024-11-13 15:02:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:21,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:22,098 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:02:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546725265] [2024-11-13 15:02:22,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546725265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566836617] [2024-11-13 15:02:22,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:22,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:22,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:22,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:22,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:02:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:22,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 15:02:22,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:22,386 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 15:02:22,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:02:22,501 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:02:22,507 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:02:22,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:22,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:02:22,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:22,698 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:02:22,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:22,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 42 treesize of output 41 [2024-11-13 15:02:22,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:22,842 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:02:22,857 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:02:22,859 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:02:22,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:22,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (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_1803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 15:02:22,940 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1803 (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_1802))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 15:02:23,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1803 (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~mem52#1.base| v_ArrVal_1801))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 15:02:23,115 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-13 15:02:23,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-13 15:02:23,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_1806))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-13 15:02:23,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566836617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:23,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:02:23,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2024-11-13 15:02:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126294761] [2024-11-13 15:02:23,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:02:23,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 15:02:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:23,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 15:02:23,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=547, Unknown=19, NotChecked=204, Total=870 [2024-11-13 15:02:23,129 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 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:02:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:25,317 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-13 15:02:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:02:25,318 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 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 95 [2024-11-13 15:02:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:25,320 INFO L225 Difference]: With dead ends: 633 [2024-11-13 15:02:25,320 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 15:02:25,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1065, Unknown=19, NotChecked=284, Total=1560 [2024-11-13 15:02:25,321 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 497 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:25,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4864 Invalid, 3868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3831 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 15:02:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 15:02:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-13 15:02:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 452 states have (on average 1.5464601769911503) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-13 15:02:25,326 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 95 [2024-11-13 15:02:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:25,327 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-13 15:02:25,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 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:02:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-13 15:02:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 15:02:25,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:25,328 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:02:25,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:02:25,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:25,528 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:25,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash 773186381, now seen corresponding path program 1 times [2024-11-13 15:02:25,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:25,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861102786] [2024-11-13 15:02:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:26,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:26,520 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:02:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:26,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861102786] [2024-11-13 15:02:26,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861102786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:26,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405304588] [2024-11-13 15:02:26,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:26,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:26,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:26,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:02:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:26,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 15:02:26,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:26,826 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 15:02:26,936 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:02:26,936 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:02:26,944 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:02:26,952 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:02:26,959 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:02:27,035 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:02:27,039 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:02:27,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:27,152 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:02:27,158 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:02:27,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:27,250 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:02:27,258 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:02:27,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:27,334 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:02:27,342 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:02:27,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:27,431 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:02:27,441 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:02:27,461 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:02:27,469 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:02:27,473 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:02:27,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:27,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1978 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-13 15:02:27,559 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_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1978 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-13 15:02:27,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975))) (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~mem53#1.base| v_ArrVal_1976) .cse1 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 15:02:27,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973))) (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~mem52#1.base| v_ArrVal_1974) .cse0 v_ArrVal_1976) (select (select (store .cse1 .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1978))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1975))) (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~mem52#1.base| v_ArrVal_1974) .cse3 v_ArrVal_1976) .cse4 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 15:02:27,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1973))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1974) .cse1 v_ArrVal_1976) (select (select (store .cse2 .cse1 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1978))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1973))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1975))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1974) .cse4 v_ArrVal_1976) .cse5 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-13 15:02:27,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1973))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1984) .cse0 v_ArrVal_1974) .cse1 v_ArrVal_1976) (select (select (store .cse2 .cse1 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1978))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1973))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1975))) (let ((.cse7 (select (select .cse8 |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~mem50#1.base| v_ArrVal_1984) .cse5 v_ArrVal_1974) .cse6 v_ArrVal_1976) .cse7 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-13 15:02:27,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405304588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:27,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:02:27,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 20 [2024-11-13 15:02:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870437143] [2024-11-13 15:02:27,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:02:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 15:02:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 15:02:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=466, Unknown=15, NotChecked=294, Total=870 [2024-11-13 15:02:27,807 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 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:02:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:29,938 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-13 15:02:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:02:29,939 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 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 95 [2024-11-13 15:02:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:29,941 INFO L225 Difference]: With dead ends: 632 [2024-11-13 15:02:29,942 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 15:02:29,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=956, Unknown=17, NotChecked=414, Total=1560 [2024-11-13 15:02:29,943 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 498 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:29,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2282 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:02:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 15:02:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 614. [2024-11-13 15:02:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 438 states have (on average 1.5593607305936072) internal successors, (683), 607 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:02:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 709 transitions. [2024-11-13 15:02:29,954 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 709 transitions. Word has length 95 [2024-11-13 15:02:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:29,955 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 709 transitions. [2024-11-13 15:02:29,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 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:02:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 709 transitions. [2024-11-13 15:02:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 15:02:29,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:29,956 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:02:29,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 15:02:30,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:30,157 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1699148927, now seen corresponding path program 1 times [2024-11-13 15:02:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140787093] [2024-11-13 15:02:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:30,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:30,867 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:02:30,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:30,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140787093] [2024-11-13 15:02:30,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140787093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:30,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:30,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:02:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353764147] [2024-11-13 15:02:30,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:30,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:02:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:02:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:02:30,870 INFO L87 Difference]: Start difference. First operand 614 states and 709 transitions. Second operand has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 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:02:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:32,667 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-13 15:02:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:02:32,668 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 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:02:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:32,670 INFO L225 Difference]: With dead ends: 637 [2024-11-13 15:02:32,670 INFO L226 Difference]: Without dead ends: 637 [2024-11-13 15:02:32,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-13 15:02:32,670 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 511 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:32,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3566 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:02:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-13 15:02:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-13 15:02:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5416666666666667) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2024-11-13 15:02:32,680 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 98 [2024-11-13 15:02:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:32,680 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2024-11-13 15:02:32,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 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:02:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2024-11-13 15:02:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 15:02:32,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:32,682 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:02:32,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:02:32,682 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:32,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1699148926, now seen corresponding path program 1 times [2024-11-13 15:02:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:32,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831851615] [2024-11-13 15:02:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:33,786 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:02:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831851615] [2024-11-13 15:02:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831851615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:33,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 15:02:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623738887] [2024-11-13 15:02:33,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:33,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:02:33,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:33,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:02:33,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:02:33,788 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 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:02:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:35,963 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-13 15:02:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:02:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 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:02:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:35,965 INFO L225 Difference]: With dead ends: 636 [2024-11-13 15:02:35,965 INFO L226 Difference]: Without dead ends: 636 [2024-11-13 15:02:35,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 15:02:35,966 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 510 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:35,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2809 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:02:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-13 15:02:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-13 15:02:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5394736842105263) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-13 15:02:35,976 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 98 [2024-11-13 15:02:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:35,976 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-13 15:02:35,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 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:02:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-13 15:02:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 15:02:35,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:35,977 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:02:35,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:02:35,978 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1614713330, now seen corresponding path program 1 times [2024-11-13 15:02:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321119489] [2024-11-13 15:02:35,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:36,928 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:02:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321119489] [2024-11-13 15:02:36,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321119489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563358868] [2024-11-13 15:02:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:36,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:36,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:36,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:36,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:02:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:37,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 15:02:37,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:37,225 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 15:02:37,324 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:02:37,324 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:02:37,348 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:02:37,463 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:37,463 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:02:37,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:37,516 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:02:37,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:37,569 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:02:37,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:37,619 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:02:37,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:37,668 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:02:37,681 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:02:37,710 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 15:02:37,710 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:02:37,713 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:02:37,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:38,605 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-13 15:02:38,605 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:02:38,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2326 (Array Int Int)) (v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#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~mem50#1.base| v_ArrVal_2326))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2319)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2320)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2321)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 15:02:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563358868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:38,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:02:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2024-11-13 15:02:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529392798] [2024-11-13 15:02:38,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:02:38,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 15:02:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 15:02:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1048, Unknown=45, NotChecked=68, Total=1332 [2024-11-13 15:02:38,635 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 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:02:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:40,509 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-13 15:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:02:40,509 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 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 99 [2024-11-13 15:02:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:40,511 INFO L225 Difference]: With dead ends: 635 [2024-11-13 15:02:40,511 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 15:02:40,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=282, Invalid=1657, Unknown=45, NotChecked=86, Total=2070 [2024-11-13 15:02:40,512 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 506 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:40,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3257 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:02:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 15:02:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-13 15:02:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 456 states have (on average 1.537280701754386) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-13 15:02:40,523 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 99 [2024-11-13 15:02:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:40,524 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-13 15:02:40,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 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:02:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-13 15:02:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 15:02:40,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:40,525 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:02:40,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:02:40,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-13 15:02:40,726 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1614713329, now seen corresponding path program 1 times [2024-11-13 15:02:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:40,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3712352] [2024-11-13 15:02:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,955 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:02:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3712352] [2024-11-13 15:02:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3712352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867224665] [2024-11-13 15:02:41,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:41,957 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:41,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:02:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-13 15:02:42,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:42,256 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 15:02:42,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:02:42,372 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:02:42,380 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:02:42,409 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:02:42,414 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:02:42,499 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:02:42,503 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:02:42,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:42,655 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:02:42,661 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:02:42,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:42,789 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:02:42,795 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:02:42,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:42,894 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:02:42,911 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:02:43,011 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:43,012 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:02:43,015 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:02:43,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:02:43,117 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:02:43,121 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:02:43,147 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:02:43,154 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:02:43,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:02:43,217 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-13 15:02:43,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-13 15:02:43,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:02:43,226 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:02:43,256 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:02:43,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:43,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2514) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (forall ((v_ArrVal_2517 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2513))) (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_2514) .cse1 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2517) (select (select (store .cse2 .cse1 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2024-11-13 15:02:44,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (or (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2511 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2511))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2512) .cse1 v_ArrVal_2514) (select (select (store .cse2 .cse1 v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2516))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (forall ((v_ArrVal_2517 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2511))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2513))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2512) .cse4 v_ArrVal_2514) .cse5 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2517) (select (select (store .cse6 .cse5 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false [2024-11-13 15:02:46,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:02:46,308 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:02:46,693 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~malloc57#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2517 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2522))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2510))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2511))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2513))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2523) .cse0 v_ArrVal_2509) .cse1 v_ArrVal_2512) .cse2 v_ArrVal_2514) .cse3 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2517) (select (select (store .cse5 .cse3 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_30 (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_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_28))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_27))) (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~mem50#1.base| v_prenex_24) .cse9 v_prenex_30) .cse10 v_prenex_25) .cse11 v_prenex_22) (select (select (store .cse12 .cse11 v_prenex_23) |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:02:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867224665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:46,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:02:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-13 15:02:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019437170] [2024-11-13 15:02:46,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:02:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 15:02:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:46,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 15:02:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1438, Unknown=31, NotChecked=240, Total=1892 [2024-11-13 15:02:46,706 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 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:02:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:52,975 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-13 15:02:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 15:02:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 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:02:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:52,977 INFO L225 Difference]: With dead ends: 634 [2024-11-13 15:02:52,977 INFO L226 Difference]: Without dead ends: 634 [2024-11-13 15:02:52,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=337, Invalid=2506, Unknown=31, NotChecked=318, Total=3192 [2024-11-13 15:02:52,979 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 504 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 4328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:52,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 3900 Invalid, 4328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 4293 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-13 15:02:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-13 15:02:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 612. [2024-11-13 15:02:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 438 states have (on average 1.5547945205479452) internal successors, (681), 605 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:02:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 707 transitions. [2024-11-13 15:02:52,991 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 707 transitions. Word has length 99 [2024-11-13 15:02:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 707 transitions. [2024-11-13 15:02:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 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:02:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 707 transitions. [2024-11-13 15:02:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 15:02:52,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:52,995 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] [2024-11-13 15:02:53,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:02:53,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-13 15:02:53,196 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1139495996, now seen corresponding path program 1 times [2024-11-13 15:02:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252680605] [2024-11-13 15:02:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:53,881 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:02:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252680605] [2024-11-13 15:02:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252680605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 15:02:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131420412] [2024-11-13 15:02:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:53,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:02:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:02:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:02:53,883 INFO L87 Difference]: Start difference. First operand 612 states and 707 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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:02:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:56,551 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-13 15:02:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:02:56,551 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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 101 [2024-11-13 15:02:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:56,553 INFO L225 Difference]: With dead ends: 638 [2024-11-13 15:02:56,553 INFO L226 Difference]: Without dead ends: 638 [2024-11-13 15:02:56,554 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:02:56,554 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 513 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:56,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2991 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 15:02:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-13 15:02:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2024-11-13 15:02:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 459 states have (on average 1.5337690631808278) internal successors, (704), 626 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:02:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 731 transitions. [2024-11-13 15:02:56,566 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 731 transitions. Word has length 101 [2024-11-13 15:02:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:56,567 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 731 transitions. [2024-11-13 15:02:56,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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:02:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 731 transitions. [2024-11-13 15:02:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 15:02:56,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:02:56,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 15:02:56,568 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:02:56,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1139495997, now seen corresponding path program 1 times [2024-11-13 15:02:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:56,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009244932] [2024-11-13 15:02:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:02:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:58,016 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:02:58,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009244932] [2024-11-13 15:02:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009244932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:58,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 15:02:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232293345] [2024-11-13 15:02:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:58,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:02:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:02:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:02:58,017 INFO L87 Difference]: Start difference. First operand 634 states and 731 transitions. Second operand has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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:03:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:01,945 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-13 15:03:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:03:01,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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 101 [2024-11-13 15:03:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:01,948 INFO L225 Difference]: With dead ends: 637 [2024-11-13 15:03:01,948 INFO L226 Difference]: Without dead ends: 637 [2024-11-13 15:03:01,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-13 15:03:01,949 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 510 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:01,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2806 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-13 15:03:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-13 15:03:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2024-11-13 15:03:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 459 states have (on average 1.5315904139433552) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:03:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2024-11-13 15:03:01,960 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 101 [2024-11-13 15:03:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:01,961 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2024-11-13 15:03:01,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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:03:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2024-11-13 15:03:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 15:03:01,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:01,962 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:03:01,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 15:03:01,962 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:03:01,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash -290469233, now seen corresponding path program 1 times [2024-11-13 15:03:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053974363] [2024-11-13 15:03:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:03:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:02,967 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:03:02,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:02,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053974363] [2024-11-13 15:03:02,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053974363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:02,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273109842] [2024-11-13 15:03:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:02,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:02,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:02,970 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:03:02,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:03:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:03,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 15:03:03,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:03,296 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 15:03:03,491 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:03:03,492 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:03:03,500 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:03:03,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:03,571 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:03:03,652 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:03,653 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:03:03,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:03,741 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:03:03,825 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:03,826 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:03:03,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:03,910 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:03:03,981 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:03,982 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:03:04,049 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:03:04,052 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:03:04,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:03:04,077 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 15:03:04,078 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:03:04,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem56#1.base|)) is different from false [2024-11-13 15:03:04,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (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_2885) |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:03:04,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (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| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2884))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2885)) |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:03:12,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2882))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2883)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 15:03:12,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (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_2882))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2883)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2885)) |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:03:12,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2889 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (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 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2889))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2882)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2883)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 15:03:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273109842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:12,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:03:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 22 [2024-11-13 15:03:12,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685033943] [2024-11-13 15:03:12,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:03:12,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 15:03:12,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:12,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 15:03:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=578, Unknown=33, NotChecked=330, Total=1056 [2024-11-13 15:03:12,164 INFO L87 Difference]: Start difference. First operand 634 states and 730 transitions. Second operand has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 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:03:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:15,342 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-13 15:03:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:03:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 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 102 [2024-11-13 15:03:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:15,344 INFO L225 Difference]: With dead ends: 636 [2024-11-13 15:03:15,344 INFO L226 Difference]: Without dead ends: 636 [2024-11-13 15:03:15,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=211, Invalid=1112, Unknown=33, NotChecked=450, Total=1806 [2024-11-13 15:03:15,345 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 511 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:15,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3619 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 15:03:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-13 15:03:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-13 15:03:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 459 states have (on average 1.5294117647058822) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:03:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-13 15:03:15,351 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 102 [2024-11-13 15:03:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:15,352 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-13 15:03:15,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 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:03:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-13 15:03:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 15:03:15,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:15,353 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:03:15,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 15:03:15,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:15,553 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:03:15,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash -290469232, now seen corresponding path program 1 times [2024-11-13 15:03:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738666939] [2024-11-13 15:03:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:03:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:17,177 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:03:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738666939] [2024-11-13 15:03:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738666939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539550798] [2024-11-13 15:03:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:17,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:17,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:17,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:03:17,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:03:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:17,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 15:03:17,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:17,620 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 15:03:17,828 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:03:17,829 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:03:17,840 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:03:17,885 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:03:17,889 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:03:18,026 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:03:18,034 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:03:18,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:18,403 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:03:18,410 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:03:18,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:18,687 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:03:18,698 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:03:18,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:18,902 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:03:18,908 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:03:19,049 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:19,049 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:03:19,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:03:19,206 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:19,206 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:03:19,212 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:03:19,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:03:19,368 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-13 15:03:19,368 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:03:19,396 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-13 15:03:19,396 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:03:19,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:03:19,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:03:19,536 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:03:19,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 15:03:19,579 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:03:19,588 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:03:19,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:03:19,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3094 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3094) |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~mem56#1.base| v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:03:20,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (forall ((v_ArrVal_3092 Int) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3091))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3090) .cse0 v_ArrVal_3094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3092) (select (select (store .cse2 .cse0 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3090) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)))))) is different from false [2024-11-13 15:03:20,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0))) (forall ((v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3089))) (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~mem54#1.base| v_ArrVal_3088) .cse0 v_ArrVal_3090) (select (select (store .cse1 .cse0 v_ArrVal_3091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3094))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 40)))) (forall ((v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (forall ((v_ArrVal_3092 Int) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3089))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_3091))) (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~mem54#1.base| v_ArrVal_3088) .cse3 v_ArrVal_3090) .cse4 v_ArrVal_3094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3092) (select (select (store .cse5 .cse4 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-13 15:03:20,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (or (forall ((v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3089))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3088) .cse1 v_ArrVal_3090) (select (select (store .cse2 .cse1 v_ArrVal_3091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3094))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)))) (forall ((v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (forall ((v_ArrVal_3092 Int) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3089))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3091))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3088) .cse4 v_ArrVal_3090) .cse5 v_ArrVal_3094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3092) (select (select (store .cse6 .cse5 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-13 15:03:33,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3094 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3085))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3086))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3089))) (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~mem52#1.base| v_ArrVal_3084) .cse0 v_ArrVal_3087) .cse1 v_ArrVal_3088) .cse2 v_ArrVal_3090) (select (select (store .cse3 .cse2 v_ArrVal_3091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3094))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)))) (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (forall ((v_ArrVal_3092 Int) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3085))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3086))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3089))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3091))) (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~mem52#1.base| v_ArrVal_3084) .cse7 v_ArrVal_3087) .cse8 v_ArrVal_3088) .cse9 v_ArrVal_3090) .cse10 v_ArrVal_3094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3092) (select (select (store .cse11 .cse10 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-13 15:03:55,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:03:55,343 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:03:59,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_31 Int) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3092 Int) (v_prenex_32 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (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_39 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (or (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_39))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_prenex_36))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_prenex_37))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_prenex_42))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_prenex_33))) (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~mem50#1.base| v_prenex_41) .cse0 v_prenex_35) .cse1 v_prenex_38) .cse2 v_prenex_40) .cse3 v_prenex_32) .cse4 v_prenex_34) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| v_prenex_31 v_ArrVal_3092) (select (select (store .cse6 .cse4 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_31))) (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3099 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3100 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3094 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3099))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_3085))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3086))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3089))) (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~mem50#1.base| v_ArrVal_3100) .cse11 v_ArrVal_3084) .cse12 v_ArrVal_3087) .cse13 v_ArrVal_3088) .cse14 v_ArrVal_3090) (select (select (store .cse15 .cse14 v_ArrVal_3091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3094))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-11-13 15:03:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539550798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:59,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:03:59,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2024-11-13 15:03:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987825102] [2024-11-13 15:03:59,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:03:59,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 15:03:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:59,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 15:03:59,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1390, Unknown=37, NotChecked=498, Total=2162 [2024-11-13 15:03:59,049 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 33 states, 30 states have (on average 5.533333333333333) internal successors, (166), 31 states have internal predecessors, (166), 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:04:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:04:34,593 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-13 15:04:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:04:34,594 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.533333333333333) internal successors, (166), 31 states have internal predecessors, (166), 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 102 [2024-11-13 15:04:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:04:34,596 INFO L225 Difference]: With dead ends: 635 [2024-11-13 15:04:34,596 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 15:04:34,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=416, Invalid=2541, Unknown=37, NotChecked=666, Total=3660 [2024-11-13 15:04:34,597 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 495 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 4581 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:04:34,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 4241 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4581 Invalid, 0 Unknown, 0 Unchecked, 31.9s Time] [2024-11-13 15:04:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 15:04:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 610. [2024-11-13 15:04:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 438 states have (on average 1.5502283105022832) internal successors, (679), 603 states have internal predecessors, (679), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:04:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 705 transitions. [2024-11-13 15:04:34,603 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 705 transitions. Word has length 102 [2024-11-13 15:04:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:04:34,603 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 705 transitions. [2024-11-13 15:04:34,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.533333333333333) internal successors, (166), 31 states have internal predecessors, (166), 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:04:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 705 transitions. [2024-11-13 15:04:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:04:34,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:04:34,604 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] [2024-11-13 15:04:34,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 15:04:34,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 15:04:34,805 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:04:34,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -695654200, now seen corresponding path program 1 times [2024-11-13 15:04:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209609354] [2024-11-13 15:04:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:04:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:37,295 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:04:37,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:37,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209609354] [2024-11-13 15:04:37,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209609354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:37,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:37,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 15:04:37,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180976180] [2024-11-13 15:04:37,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:04:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:04:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:04:37,297 INFO L87 Difference]: Start difference. First operand 610 states and 705 transitions. Second operand has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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:04:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:04:58,619 INFO L93 Difference]: Finished difference Result 661 states and 761 transitions. [2024-11-13 15:04:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:04:58,619 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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 104 [2024-11-13 15:04:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:04:58,621 INFO L225 Difference]: With dead ends: 661 [2024-11-13 15:04:58,621 INFO L226 Difference]: Without dead ends: 661 [2024-11-13 15:04:58,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-13 15:04:58,622 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 595 mSDsluCounter, 3322 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:04:58,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 3685 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2922 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2024-11-13 15:04:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-13 15:04:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 635. [2024-11-13 15:04:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 462 states have (on average 1.525974025974026) internal successors, (705), 627 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:04:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 732 transitions. [2024-11-13 15:04:58,629 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 732 transitions. Word has length 104 [2024-11-13 15:04:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:04:58,629 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 732 transitions. [2024-11-13 15:04:58,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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:04:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 732 transitions. [2024-11-13 15:04:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:04:58,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:04:58,630 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] [2024-11-13 15:04:58,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 15:04:58,630 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:04:58,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash -695654199, now seen corresponding path program 1 times [2024-11-13 15:04:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237385908] [2024-11-13 15:04:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:05:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:01,697 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:05:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:01,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237385908] [2024-11-13 15:05:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237385908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:01,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 15:05:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922626249] [2024-11-13 15:05:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:05:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:05:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:05:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:05:01,699 INFO L87 Difference]: Start difference. First operand 635 states and 732 transitions. Second operand has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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:05:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:19,917 INFO L93 Difference]: Finished difference Result 660 states and 760 transitions. [2024-11-13 15:05:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:05:19,918 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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 104 [2024-11-13 15:05:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:19,920 INFO L225 Difference]: With dead ends: 660 [2024-11-13 15:05:19,920 INFO L226 Difference]: Without dead ends: 660 [2024-11-13 15:05:19,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-13 15:05:19,926 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 566 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:19,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 2563 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-11-13 15:05:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-13 15:05:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 635. [2024-11-13 15:05:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 462 states have (on average 1.5238095238095237) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:05:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2024-11-13 15:05:19,954 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 104 [2024-11-13 15:05:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:19,954 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2024-11-13 15:05:19,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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:05:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2024-11-13 15:05:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 15:05:19,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:19,956 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:05:19,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 15:05:19,956 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:05:19,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash 990817685, now seen corresponding path program 1 times [2024-11-13 15:05:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:19,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92089711] [2024-11-13 15:05:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:05:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:25,248 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:05:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92089711] [2024-11-13 15:05:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92089711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:25,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 15:05:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302403633] [2024-11-13 15:05:25,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:25,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:05:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:05:25,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:05:25,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:05:25,250 INFO L87 Difference]: Start difference. First operand 635 states and 731 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:05:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:47,586 INFO L93 Difference]: Finished difference Result 651 states and 749 transitions. [2024-11-13 15:05:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:05:47,587 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:05:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:47,589 INFO L225 Difference]: With dead ends: 651 [2024-11-13 15:05:47,589 INFO L226 Difference]: Without dead ends: 651 [2024-11-13 15:05:47,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2024-11-13 15:05:47,590 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1499 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 3879 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:47,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 3879 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 20.1s Time] [2024-11-13 15:05:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-13 15:05:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 634. [2024-11-13 15:05:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 462 states have (on average 1.5216450216450217) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:05:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2024-11-13 15:05:47,600 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 105 [2024-11-13 15:05:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:47,600 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2024-11-13 15:05:47,600 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:05:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2024-11-13 15:05:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 15:05:47,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:47,601 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:05:47,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 15:05:47,602 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:05:47,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 990817686, now seen corresponding path program 1 times [2024-11-13 15:05:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528645340] [2024-11-13 15:05:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:05:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:52,295 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:05:52,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528645340] [2024-11-13 15:05:52,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528645340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:05:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193603838] [2024-11-13 15:05:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:52,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:05:52,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:05:52,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:05:52,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 15:05:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:52,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 15:05:52,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:52,696 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 15:05:53,747 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:05:53,748 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:05:53,794 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:05:53,809 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:05:54,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:05:54,310 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:05:54,327 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:05:54,798 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:05:54,799 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:05:54,815 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:05:55,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:05:55,273 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:05:55,293 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:05:55,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:05:55,776 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:05:55,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:05:56,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:05:56,293 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:05:56,309 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:05:56,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:05:56,827 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:05:56,844 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:05:57,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:05:57,609 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:05:57,623 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:05:57,714 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:05:57,733 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:05:57,973 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:05:57,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:05:58,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3599) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3599 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3599) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 15:05:58,681 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_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3599) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3599 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3599) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:05:58,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:05:58,783 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 80 treesize of output 84 [2024-11-13 15:05:58,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3597) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3599) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_43))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_44) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) is different from false [2024-11-13 15:05:59,723 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (< (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3595))) (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_3594) .cse0 v_prenex_44) (select (select (store .cse1 .cse0 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3595))) (let ((.cse3 (select (select .cse4 |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_3594) .cse3 v_ArrVal_3597) (select (select (store .cse4 .cse3 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3599))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3595))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (let ((.cse5 (store .cse6 .cse7 v_prenex_43))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse7)))))) is different from false [2024-11-13 15:05:59,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3595))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3594) .cse1 v_ArrVal_3597) (select (select (store .cse2 .cse1 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3599))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3595))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3594) .cse4 v_prenex_44) (select (select (store .cse5 .cse4 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_45))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3595))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse6 (select (select (let ((.cse7 (store .cse8 .cse6 v_prenex_43))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) is different from false [2024-11-13 15:06:00,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3593))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3595))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3592) .cse0 v_ArrVal_3594) .cse1 v_ArrVal_3597) (select (select (store .cse2 .cse1 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3599))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3593))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3595))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3592) .cse5 v_ArrVal_3594) .cse6 v_prenex_44) (select (select (store .cse7 .cse6 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_45))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3593))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3595)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse9 (store .cse10 .cse11 v_prenex_43))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse11)))))) is different from false [2024-11-13 15:06:00,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3593))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3595)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_prenex_43))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3593))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3595))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3592) .cse6 v_ArrVal_3594) .cse7 v_prenex_44) (select (select (store .cse8 .cse7 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_45))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3593))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3595))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3592) .cse10 v_ArrVal_3594) .cse11 v_ArrVal_3597) (select (select (store .cse12 .cse11 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3599))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:06:00,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3590))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3593))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3595))) (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_3591) .cse0 v_ArrVal_3592) .cse1 v_ArrVal_3594) .cse2 v_prenex_44) (select (select (store .cse3 .cse2 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_45))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3599 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3590))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_3593))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3595))) (let ((.cse9 (select (select .cse10 |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_3591) .cse7 v_ArrVal_3592) .cse8 v_ArrVal_3594) .cse9 v_ArrVal_3597) (select (select (store .cse10 .cse9 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3599))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3590))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3593)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3595)))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= .cse13 (select (select (let ((.cse14 (store .cse15 .cse13 v_prenex_43))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))) is different from false [2024-11-13 15:06:00,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (and (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3599 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3590))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3593))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3595))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3591) .cse1 v_ArrVal_3592) .cse2 v_ArrVal_3594) .cse3 v_ArrVal_3597) (select (select (store .cse4 .cse3 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3599))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3590))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3593)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3595)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse8 (select (select (let ((.cse9 (store .cse10 .cse8 v_prenex_43))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (< (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3590))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3593))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3595))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3591) .cse13 v_ArrVal_3592) .cse14 v_ArrVal_3594) .cse15 v_prenex_44) (select (select (store .cse16 .cse15 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_45))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1))))) is different from false [2024-11-13 15:06:04,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3599 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3589))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3590))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3593))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3595))) (let ((.cse3 (select (select .cse4 |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~mem52#1.base| v_ArrVal_3588) .cse0 v_ArrVal_3591) .cse1 v_ArrVal_3592) .cse2 v_ArrVal_3594) .cse3 v_ArrVal_3597) (select (select (store .cse4 .cse3 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3599))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (< (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3589))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_3590))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3593))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3595))) (let ((.cse12 (select (select .cse13 |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~mem52#1.base| v_ArrVal_3588) .cse9 v_ArrVal_3591) .cse10 v_ArrVal_3592) .cse11 v_ArrVal_3594) .cse12 v_prenex_44) (select (select (store .cse13 .cse12 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_45))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse18 (let ((.cse20 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3589))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3590)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3593)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3595)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= (select (select (let ((.cse17 (store .cse18 .cse19 v_prenex_43))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) .cse19)))))) is different from false [2024-11-13 15:06:10,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3589))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3590)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3593)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3595)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_43))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3598)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (< (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3589))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3590))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3593))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3595))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3588) .cse8 v_ArrVal_3591) .cse9 v_ArrVal_3592) .cse10 v_ArrVal_3594) .cse11 v_prenex_44) (select (select (store .cse12 .cse11 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3599 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3589))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3590))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3593))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3595))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3588) .cse16 v_ArrVal_3591) .cse17 v_ArrVal_3592) .cse18 v_ArrVal_3594) .cse19 v_ArrVal_3597) (select (select (store .cse20 .cse19 v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3599))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 15:06:15,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-13 15:06:15,692 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 15:06:15,693 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 15:06:15,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 15:06:15,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 15:06:15,894 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2024-11-13 15:06:15,900 INFO L158 Benchmark]: Toolchain (without parser) took 295898.68ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 90.6MB in the beginning and 431.6MB in the end (delta: -341.0MB). Peak memory consumption was 226.8MB. Max. memory is 16.1GB. [2024-11-13 15:06:15,900 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:06:15,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 757.69ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 63.1MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:06:15,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.12ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 57.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:06:15,901 INFO L158 Benchmark]: Boogie Preprocessor took 183.94ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 48.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:06:15,901 INFO L158 Benchmark]: RCFGBuilder took 2469.19ms. Allocated memory is still 117.4MB. Free memory was 48.0MB in the beginning and 70.6MB in the end (delta: -22.6MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-11-13 15:06:15,901 INFO L158 Benchmark]: TraceAbstraction took 292406.23ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 69.8MB in the beginning and 431.6MB in the end (delta: -361.8MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. [2024-11-13 15:06:15,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 757.69ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 63.1MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.12ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 57.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 183.94ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 48.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2469.19ms. Allocated memory is still 117.4MB. Free memory was 48.0MB in the beginning and 70.6MB in the end (delta: -22.6MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * TraceAbstraction took 292406.23ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 69.8MB in the beginning and 431.6MB in the end (delta: -361.8MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:06:18,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:06:18,770 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 15:06:18,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:06:18,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:06:18,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:06:18,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:06:18,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:06:18,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:06:18,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:06:18,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:06:18,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:06:18,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:06:18,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:06:18,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:06:18,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:06:18,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:06:18,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:06:18,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:06:18,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:06:18,809 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:06:18,809 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:06:18,809 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:06:18,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:06:18,809 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:06:18,810 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:06:18,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:06:18,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:06:18,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:06:18,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:06:18,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:06:18,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:06:18,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:06:18,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:06:18,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:06:18,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:18,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:06:18,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:06:18,812 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:06:18,812 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:06:18,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:06:18,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:06:18,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:06:18,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:06:18,813 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_bf736742-c404-4f3d-aa34-812ae69e079b/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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2024-11-13 15:06:19,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:06:19,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:06:19,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:06:19,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:06:19,216 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:06:19,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i Unable to find full path for "g++" [2024-11-13 15:06:21,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:06:21,856 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:06:21,857 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2024-11-13 15:06:21,884 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data/00c226116/8dd150a0d0b64f0a92245878e93ad3af/FLAG84741c214 [2024-11-13 15:06:21,911 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/data/00c226116/8dd150a0d0b64f0a92245878e93ad3af [2024-11-13 15:06:21,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:06:21,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:06:21,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:21,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:06:21,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:06:21,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:21" (1/1) ... [2024-11-13 15:06:21,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5c8c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:21, skipping insertion in model container [2024-11-13 15:06:21,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:21" (1/1) ... [2024-11-13 15:06:21,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:06:22,490 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:06:22,525 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:06:22,530 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:06:22,536 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:06:22,546 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:06:22,573 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:06:22,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:22,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:06:22,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:22,780 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:06:22,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22 WrapperNode [2024-11-13 15:06:22,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:22,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:22,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:06:22,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:06:22,793 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:06:22" (1/1) ... [2024-11-13 15:06:22,843 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:06:22" (1/1) ... [2024-11-13 15:06:22,917 INFO L138 Inliner]: procedures = 179, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 622 [2024-11-13 15:06:22,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:22,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:06:22,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:06:22,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:06:22,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:22,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:22,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,033 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:06:23,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:06:23,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:06:23,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:06:23,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:06:23,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (1/1) ... [2024-11-13 15:06:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:23,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:23,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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:06:23,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/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:06:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 15:06:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 15:06:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 15:06:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 15:06:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 15:06:23,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 15:06:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 15:06:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 15:06:23,154 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 15:06:23,154 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 15:06:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:06:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:06:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:06:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:06:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:06:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:06:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:06:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 15:06:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 15:06:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:06:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:06:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:06:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:06:23,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:06:23,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:06:23,372 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 15:06:23,442 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 15:06:27,163 INFO L? ?]: Removed 686 outVars from TransFormulas that were not future-live. [2024-11-13 15:06:27,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:06:27,200 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:06:27,200 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-13 15:06:27,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:06:27 BoogieIcfgContainer [2024-11-13 15:06:27,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:06:27,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:06:27,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:06:27,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:06:27,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:06:21" (1/3) ... [2024-11-13 15:06:27,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44babd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:06:27, skipping insertion in model container [2024-11-13 15:06:27,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:22" (2/3) ... [2024-11-13 15:06:27,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44babd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:06:27, skipping insertion in model container [2024-11-13 15:06:27,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:06:27" (3/3) ... [2024-11-13 15:06:27,213 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-1.i [2024-11-13 15:06:27,238 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:06:27,240 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test1-1.i that has 4 procedures, 662 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-13 15:06:27,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:06:27,335 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;@86540dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:06:27,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-13 15:06:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 657 states, 324 states have (on average 2.2037037037037037) internal successors, (714), 651 states have internal predecessors, (714), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:06:27,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:27,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:06:27,350 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:06:27,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-13 15:06:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890164290] [2024-11-13 15:06:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:27,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:27,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:27,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:06:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:27,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:06:27,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:27,604 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 7 [2024-11-13 15:06:27,639 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:06:27,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:27,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890164290] [2024-11-13 15:06:27,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890164290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:27,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:27,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:06:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915973766] [2024-11-13 15:06:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:27,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:06:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:06:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:06:27,685 INFO L87 Difference]: Start difference. First operand has 657 states, 324 states have (on average 2.2037037037037037) internal successors, (714), 651 states have internal predecessors, (714), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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:06:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:29,400 INFO L93 Difference]: Finished difference Result 600 states and 647 transitions. [2024-11-13 15:06:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:29,402 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:06:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:29,416 INFO L225 Difference]: With dead ends: 600 [2024-11-13 15:06:29,416 INFO L226 Difference]: Without dead ends: 598 [2024-11-13 15:06:29,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:06:29,421 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 535 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:29,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 348 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:06:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-13 15:06:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2024-11-13 15:06:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 318 states have (on average 1.9371069182389937) internal successors, (616), 590 states have internal predecessors, (616), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 642 transitions. [2024-11-13 15:06:29,527 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 642 transitions. Word has length 5 [2024-11-13 15:06:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:29,528 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 642 transitions. [2024-11-13 15:06:29,528 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:06:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 642 transitions. [2024-11-13 15:06:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:06:29,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:29,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:06:29,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:06:29,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:29,734 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:06:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-13 15:06:29,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:29,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693833350] [2024-11-13 15:06:29,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:29,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:29,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:29,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:06:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:29,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:06:29,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:29,862 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 15:06:29,889 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:06:29,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:29,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693833350] [2024-11-13 15:06:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693833350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:29,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:06:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724434749] [2024-11-13 15:06:29,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:29,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:06:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:06:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:06:29,893 INFO L87 Difference]: Start difference. First operand 596 states and 642 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:06:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:31,532 INFO L93 Difference]: Finished difference Result 671 states and 721 transitions. [2024-11-13 15:06:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:31,533 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:06:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:31,537 INFO L225 Difference]: With dead ends: 671 [2024-11-13 15:06:31,537 INFO L226 Difference]: Without dead ends: 671 [2024-11-13 15:06:31,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:06:31,538 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 263 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:31,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 733 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:06:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-13 15:06:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 623. [2024-11-13 15:06:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 355 states have (on average 1.9154929577464788) internal successors, (680), 617 states have internal predecessors, (680), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 706 transitions. [2024-11-13 15:06:31,561 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 706 transitions. Word has length 5 [2024-11-13 15:06:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:31,562 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 706 transitions. [2024-11-13 15:06:31,562 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:06:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 706 transitions. [2024-11-13 15:06:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:06:31,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:31,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:06:31,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:06:31,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:31,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:31,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1422960392, now seen corresponding path program 1 times [2024-11-13 15:06:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971139204] [2024-11-13 15:06:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:31,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:31,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:31,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:06:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:31,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:06:31,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:31,944 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:06:31,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:31,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971139204] [2024-11-13 15:06:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971139204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:31,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546944395] [2024-11-13 15:06:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:31,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:31,948 INFO L87 Difference]: Start difference. First operand 623 states and 706 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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:06:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:32,732 INFO L93 Difference]: Finished difference Result 751 states and 847 transitions. [2024-11-13 15:06:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:06:32,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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:06:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:32,738 INFO L225 Difference]: With dead ends: 751 [2024-11-13 15:06:32,738 INFO L226 Difference]: Without dead ends: 751 [2024-11-13 15:06:32,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:32,739 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 137 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:32,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1753 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:06:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-13 15:06:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 705. [2024-11-13 15:06:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 437 states have (on average 1.8787185354691076) internal successors, (821), 699 states have internal predecessors, (821), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 847 transitions. [2024-11-13 15:06:32,780 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 847 transitions. Word has length 6 [2024-11-13 15:06:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:32,780 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 847 transitions. [2024-11-13 15:06:32,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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:06:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 847 transitions. [2024-11-13 15:06:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 15:06:32,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:32,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:32,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:06:32,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:32,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr318ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:32,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1162100639, now seen corresponding path program 1 times [2024-11-13 15:06:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887280858] [2024-11-13 15:06:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:32,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:32,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:32,986 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:32,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:06:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:33,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:06:33,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:33,106 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:06:33,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:33,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887280858] [2024-11-13 15:06:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887280858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:33,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:33,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:06:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792670334] [2024-11-13 15:06:33,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:33,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:06:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:06:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:06:33,108 INFO L87 Difference]: Start difference. First operand 705 states and 847 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:06:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:34,293 INFO L93 Difference]: Finished difference Result 707 states and 848 transitions. [2024-11-13 15:06:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:34,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-13 15:06:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:34,298 INFO L225 Difference]: With dead ends: 707 [2024-11-13 15:06:34,298 INFO L226 Difference]: Without dead ends: 703 [2024-11-13 15:06:34,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:06:34,300 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:34,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 995 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:06:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-13 15:06:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-11-13 15:06:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 435 states have (on average 1.8804597701149426) internal successors, (818), 697 states have internal predecessors, (818), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 844 transitions. [2024-11-13 15:06:34,331 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 844 transitions. Word has length 7 [2024-11-13 15:06:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:34,332 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 844 transitions. [2024-11-13 15:06:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:06:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 844 transitions. [2024-11-13 15:06:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:06:34,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:34,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:34,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:06:34,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:34,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:34,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610682, now seen corresponding path program 1 times [2024-11-13 15:06:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294926820] [2024-11-13 15:06:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:34,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:34,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:34,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:34,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:06:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:34,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:06:34,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:34,680 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 7 [2024-11-13 15:06:34,737 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:06:34,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:34,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294926820] [2024-11-13 15:06:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294926820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:34,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170840] [2024-11-13 15:06:34,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:34,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:34,741 INFO L87 Difference]: Start difference. First operand 703 states and 844 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:36,984 INFO L93 Difference]: Finished difference Result 688 states and 806 transitions. [2024-11-13 15:06:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:06:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:06:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:36,988 INFO L225 Difference]: With dead ends: 688 [2024-11-13 15:06:36,988 INFO L226 Difference]: Without dead ends: 688 [2024-11-13 15:06:36,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:06:36,989 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 586 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:36,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 539 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 15:06:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-13 15:06:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2024-11-13 15:06:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 435 states have (on average 1.7747126436781608) internal successors, (772), 674 states have internal predecessors, (772), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 798 transitions. [2024-11-13 15:06:37,018 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 798 transitions. Word has length 11 [2024-11-13 15:06:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:37,019 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 798 transitions. [2024-11-13 15:06:37,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 798 transitions. [2024-11-13 15:06:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:06:37,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:37,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:37,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 15:06:37,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:37,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:37,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610681, now seen corresponding path program 1 times [2024-11-13 15:06:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:37,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863049754] [2024-11-13 15:06:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:37,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:37,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:37,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:37,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:06:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:37,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:06:37,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:37,356 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:06:37,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:37,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:37,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863049754] [2024-11-13 15:06:37,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863049754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:37,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:37,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:37,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461889062] [2024-11-13 15:06:37,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:37,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:06:37,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:06:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:06:37,358 INFO L87 Difference]: Start difference. First operand 680 states and 798 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:37,402 INFO L93 Difference]: Finished difference Result 632 states and 736 transitions. [2024-11-13 15:06:37,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:37,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:06:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:37,405 INFO L225 Difference]: With dead ends: 632 [2024-11-13 15:06:37,405 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 15:06:37,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:06:37,406 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 61 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1079 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:06:37,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1079 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:06:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 15:06:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2024-11-13 15:06:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 399 states have (on average 1.7794486215538847) internal successors, (710), 626 states have internal predecessors, (710), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 736 transitions. [2024-11-13 15:06:37,424 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 736 transitions. Word has length 11 [2024-11-13 15:06:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 736 transitions. [2024-11-13 15:06:37,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 736 transitions. [2024-11-13 15:06:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 15:06:37,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:37,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:37,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:06:37,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:37,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:37,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 614285792, now seen corresponding path program 1 times [2024-11-13 15:06:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:37,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841936544] [2024-11-13 15:06:37,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:37,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:37,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:37,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:06:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:37,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:06:37,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:37,764 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:06:37,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:37,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:37,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841936544] [2024-11-13 15:06:37,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841936544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:37,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:37,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886889289] [2024-11-13 15:06:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:37,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:37,766 INFO L87 Difference]: Start difference. First operand 632 states and 736 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:06:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:37,868 INFO L93 Difference]: Finished difference Result 609 states and 692 transitions. [2024-11-13 15:06:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-13 15:06:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:37,871 INFO L225 Difference]: With dead ends: 609 [2024-11-13 15:06:37,871 INFO L226 Difference]: Without dead ends: 609 [2024-11-13 15:06:37,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:06:37,872 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 45 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:37,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1561 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:06:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-13 15:06:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-13 15:06:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 383 states have (on average 1.7389033942558747) internal successors, (666), 603 states have internal predecessors, (666), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 692 transitions. [2024-11-13 15:06:37,905 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 692 transitions. Word has length 13 [2024-11-13 15:06:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:37,906 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 692 transitions. [2024-11-13 15:06:37,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:06:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 692 transitions. [2024-11-13 15:06:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 15:06:37,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:37,908 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] [2024-11-13 15:06:37,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:06:38,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:38,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:38,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:38,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1039411378, now seen corresponding path program 1 times [2024-11-13 15:06:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933392070] [2024-11-13 15:06:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:38,113 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:38,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:06:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:06:38,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:38,256 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 15:06:38,557 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:06:38,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:38,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933392070] [2024-11-13 15:06:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933392070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:38,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:06:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779358022] [2024-11-13 15:06:38,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:38,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:38,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:38,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:38,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:38,561 INFO L87 Difference]: Start difference. First operand 609 states and 692 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:41,085 INFO L93 Difference]: Finished difference Result 661 states and 707 transitions. [2024-11-13 15:06:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:06:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 15:06:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:41,089 INFO L225 Difference]: With dead ends: 661 [2024-11-13 15:06:41,089 INFO L226 Difference]: Without dead ends: 661 [2024-11-13 15:06:41,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:06:41,090 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 196 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:41,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1073 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 15:06:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-13 15:06:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 605. [2024-11-13 15:06:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.7180156657963446) internal successors, (658), 599 states have internal predecessors, (658), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2024-11-13 15:06:41,105 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 27 [2024-11-13 15:06:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:41,106 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2024-11-13 15:06:41,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2024-11-13 15:06:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 15:06:41,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:41,107 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] [2024-11-13 15:06:41,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:06:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:41,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:41,313 INFO L85 PathProgramCache]: Analyzing trace with hash 860255478, now seen corresponding path program 1 times [2024-11-13 15:06:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634720932] [2024-11-13 15:06:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:41,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:41,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:06:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:41,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:06:41,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:41,594 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:06:41,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:41,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634720932] [2024-11-13 15:06:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634720932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:41,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528287569] [2024-11-13 15:06:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:41,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:41,600 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:41,700 INFO L93 Difference]: Finished difference Result 593 states and 664 transitions. [2024-11-13 15:06:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-13 15:06:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:41,702 INFO L225 Difference]: With dead ends: 593 [2024-11-13 15:06:41,703 INFO L226 Difference]: Without dead ends: 593 [2024-11-13 15:06:41,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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:06:41,703 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 21 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1547 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:41,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1547 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:06:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-13 15:06:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2024-11-13 15:06:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 371 states have (on average 1.719676549865229) internal successors, (638), 587 states have internal predecessors, (638), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 664 transitions. [2024-11-13 15:06:41,720 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 664 transitions. Word has length 46 [2024-11-13 15:06:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:41,721 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 664 transitions. [2024-11-13 15:06:41,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:06:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 664 transitions. [2024-11-13 15:06:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 15:06:41,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:41,725 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] [2024-11-13 15:06:41,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:06:41,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:41,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:41,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 61796394, now seen corresponding path program 1 times [2024-11-13 15:06:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316101454] [2024-11-13 15:06:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:41,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:41,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:41,933 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:41,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:06:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:06:42,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:42,198 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 15:06:43,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:06:43,119 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:06:43,163 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:06:43,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:06:43,181 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:06:43,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:43,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:43,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316101454] [2024-11-13 15:06:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316101454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:43,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:43,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:43,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398018385] [2024-11-13 15:06:43,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:43,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:06:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:43,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:06:43,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:06:43,183 INFO L87 Difference]: Start difference. First operand 593 states and 664 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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:06:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:45,310 INFO L93 Difference]: Finished difference Result 555 states and 626 transitions. [2024-11-13 15:06:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:06:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-13 15:06:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:45,313 INFO L225 Difference]: With dead ends: 555 [2024-11-13 15:06:45,313 INFO L226 Difference]: Without dead ends: 555 [2024-11-13 15:06:45,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:06:45,315 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 783 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:45,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 358 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:06:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-13 15:06:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 518. [2024-11-13 15:06:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 334 states have (on average 1.5748502994011977) internal successors, (526), 512 states have internal predecessors, (526), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 552 transitions. [2024-11-13 15:06:45,332 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 552 transitions. Word has length 54 [2024-11-13 15:06:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:45,333 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 552 transitions. [2024-11-13 15:06:45,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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:06:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 552 transitions. [2024-11-13 15:06:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:06:45,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:45,336 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] [2024-11-13 15:06:45,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:06:45,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:45,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:45,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash -119945916, now seen corresponding path program 1 times [2024-11-13 15:06:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:45,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202788187] [2024-11-13 15:06:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:45,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:45,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:45,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:45,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:06:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:45,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:06:45,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:45,789 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 7 [2024-11-13 15:06:45,811 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:06:45,852 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 23 treesize of output 11 [2024-11-13 15:06:45,869 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:06:45,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:45,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202788187] [2024-11-13 15:06:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202788187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505548498] [2024-11-13 15:06:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:45,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:06:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:06:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:06:45,872 INFO L87 Difference]: Start difference. First operand 518 states and 552 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:06:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:47,788 INFO L93 Difference]: Finished difference Result 517 states and 551 transitions. [2024-11-13 15:06:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:06:47,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-13 15:06:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:47,791 INFO L225 Difference]: With dead ends: 517 [2024-11-13 15:06:47,791 INFO L226 Difference]: Without dead ends: 517 [2024-11-13 15:06:47,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:06:47,792 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 2 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:47,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1309 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:06:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-13 15:06:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2024-11-13 15:06:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 334 states have (on average 1.5718562874251496) internal successors, (525), 511 states have internal predecessors, (525), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 551 transitions. [2024-11-13 15:06:47,805 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 551 transitions. Word has length 59 [2024-11-13 15:06:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:47,805 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 551 transitions. [2024-11-13 15:06:47,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:06:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 551 transitions. [2024-11-13 15:06:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:06:47,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:47,806 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] [2024-11-13 15:06:47,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 15:06:48,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:48,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:48,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash -119945915, now seen corresponding path program 1 times [2024-11-13 15:06:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:48,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540019390] [2024-11-13 15:06:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:48,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:48,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:48,011 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:48,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:06:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:48,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:06:48,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:48,256 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 15:06:48,284 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:06:48,295 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:06:48,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 15:06:48,378 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:06:48,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:48,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540019390] [2024-11-13 15:06:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540019390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:48,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372718051] [2024-11-13 15:06:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:48,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:06:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:48,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:06:48,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:06:48,380 INFO L87 Difference]: Start difference. First operand 517 states and 551 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:06:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:50,658 INFO L93 Difference]: Finished difference Result 516 states and 550 transitions. [2024-11-13 15:06:50,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:06:50,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-13 15:06:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:50,661 INFO L225 Difference]: With dead ends: 516 [2024-11-13 15:06:50,661 INFO L226 Difference]: Without dead ends: 516 [2024-11-13 15:06:50,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:06:50,662 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 1 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:50,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1316 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 15:06:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-13 15:06:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-11-13 15:06:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 333 states have (on average 1.5735735735735736) internal successors, (524), 510 states have internal predecessors, (524), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:06:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 550 transitions. [2024-11-13 15:06:50,672 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 550 transitions. Word has length 59 [2024-11-13 15:06:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:50,672 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 550 transitions. [2024-11-13 15:06:50,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:06:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 550 transitions. [2024-11-13 15:06:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 15:06:50,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:50,674 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] [2024-11-13 15:06:50,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 15:06:50,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:50,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:50,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash -911788245, now seen corresponding path program 1 times [2024-11-13 15:06:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:50,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969966943] [2024-11-13 15:06:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:50,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:50,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:50,878 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:50,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 15:06:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:51,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:06:51,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:51,130 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:06:51,253 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 23 treesize of output 11 [2024-11-13 15:06:51,273 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:06:51,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:51,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969966943] [2024-11-13 15:06:51,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969966943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:51,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:51,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:06:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321600226] [2024-11-13 15:06:51,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:51,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:06:51,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:06:51,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:06:51,275 INFO L87 Difference]: Start difference. First operand 516 states and 550 transitions. Second operand has 7 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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:06:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:53,783 INFO L93 Difference]: Finished difference Result 528 states and 565 transitions. [2024-11-13 15:06:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:06:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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 67 [2024-11-13 15:06:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:53,786 INFO L225 Difference]: With dead ends: 528 [2024-11-13 15:06:53,787 INFO L226 Difference]: Without dead ends: 528 [2024-11-13 15:06:53,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:06:53,787 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 12 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:53,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1714 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 15:06:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-13 15:06:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 522. [2024-11-13 15:06:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 338 states have (on average 1.5710059171597632) internal successors, (531), 515 states have internal predecessors, (531), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-13 15:06:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 560 transitions. [2024-11-13 15:06:53,804 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 560 transitions. Word has length 67 [2024-11-13 15:06:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:53,805 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 560 transitions. [2024-11-13 15:06:53,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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:06:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 560 transitions. [2024-11-13 15:06:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 15:06:53,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:53,808 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] [2024-11-13 15:06:53,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 15:06:54,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:54,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:54,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash -911788244, now seen corresponding path program 1 times [2024-11-13 15:06:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:54,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670839962] [2024-11-13 15:06:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:54,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:54,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:54,012 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:54,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 15:06:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:54,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:06:54,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:54,282 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:06:54,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:06:54,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670839962] [2024-11-13 15:06:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670839962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:54,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957323537] [2024-11-13 15:06:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:54,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:54,285 INFO L87 Difference]: Start difference. First operand 522 states and 560 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:06:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:54,357 INFO L93 Difference]: Finished difference Result 519 states and 554 transitions. [2024-11-13 15:06:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:06:54,358 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), 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 67 [2024-11-13 15:06:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:54,360 INFO L225 Difference]: With dead ends: 519 [2024-11-13 15:06:54,360 INFO L226 Difference]: Without dead ends: 519 [2024-11-13 15:06:54,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:54,361 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 0 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:54,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1492 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:06:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-13 15:06:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2024-11-13 15:06:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 335 states have (on average 1.5731343283582089) internal successors, (527), 513 states have internal predecessors, (527), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:06:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 554 transitions. [2024-11-13 15:06:54,374 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 554 transitions. Word has length 67 [2024-11-13 15:06:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:54,374 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 554 transitions. [2024-11-13 15:06:54,374 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), 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:06:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 554 transitions. [2024-11-13 15:06:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 15:06:54,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:54,375 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] [2024-11-13 15:06:54,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 15:06:54,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:54,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:54,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash -902381298, now seen corresponding path program 1 times [2024-11-13 15:06:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265437427] [2024-11-13 15:06:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:54,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:54,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:54,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 15:06:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:54,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:06:54,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:54,851 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:06:54,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:06:54,960 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:06:54,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265437427] [2024-11-13 15:06:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265437427] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:06:54,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:06:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-13 15:06:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765482091] [2024-11-13 15:06:54,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:06:54,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:06:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:06:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:06:54,963 INFO L87 Difference]: Start difference. First operand 519 states and 554 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:06:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:55,273 INFO L93 Difference]: Finished difference Result 531 states and 571 transitions. [2024-11-13 15:06:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:06:55,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-13 15:06:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:55,277 INFO L225 Difference]: With dead ends: 531 [2024-11-13 15:06:55,277 INFO L226 Difference]: Without dead ends: 531 [2024-11-13 15:06:55,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:06:55,278 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 8 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:55,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1495 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:06:55,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-13 15:06:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2024-11-13 15:06:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 344 states have (on average 1.5755813953488371) internal successors, (542), 522 states have internal predecessors, (542), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:06:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 569 transitions. [2024-11-13 15:06:55,291 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 569 transitions. Word has length 68 [2024-11-13 15:06:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:55,291 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 569 transitions. [2024-11-13 15:06:55,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:06:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 569 transitions. [2024-11-13 15:06:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:06:55,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:55,292 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:55,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 15:06:55,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:55,493 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:06:55,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:55,494 INFO L85 PathProgramCache]: Analyzing trace with hash 908859371, now seen corresponding path program 2 times [2024-11-13 15:06:55,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:06:55,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852025786] [2024-11-13 15:06:55,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:06:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:55,497 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:55,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 15:07:05,357 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:07:05,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:07:05,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 15:07:05,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:05,521 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:07:05,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:07:05,557 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:07:05,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:07:05,807 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 44 treesize of output 43 [2024-11-13 15:07:05,876 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 33 treesize of output 15 [2024-11-13 15:07:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 15:07:05,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:06,078 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-13 15:07:06,079 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 25 treesize of output 24 [2024-11-13 15:07:06,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-13 15:07:06,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:06,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852025786] [2024-11-13 15:07:06,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852025786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:07:06,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2021770594] [2024-11-13 15:07:06,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:07:06,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:07:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:07:06,119 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:07:06,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-13 15:07:07,129 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:07:07,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:07:07,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:07:07,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:07,368 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 15:07:07,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:07,832 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 15:07:07,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2021770594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:07:07,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:07:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-13 15:07:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966577491] [2024-11-13 15:07:07,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:07:07,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 15:07:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 15:07:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-13 15:07:07,836 INFO L87 Difference]: Start difference. First operand 529 states and 569 transitions. Second operand has 24 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:07:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:17,342 INFO L93 Difference]: Finished difference Result 545 states and 591 transitions. [2024-11-13 15:07:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 15:07:17,343 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2024-11-13 15:07:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:17,344 INFO L225 Difference]: With dead ends: 545 [2024-11-13 15:07:17,344 INFO L226 Difference]: Without dead ends: 539 [2024-11-13 15:07:17,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=392, Invalid=2161, Unknown=1, NotChecked=98, Total=2652 [2024-11-13 15:07:17,345 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 451 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:17,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 3482 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-13 15:07:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-13 15:07:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2024-11-13 15:07:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 353 states have (on average 1.5637393767705383) internal successors, (552), 530 states have internal predecessors, (552), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:07:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 579 transitions. [2024-11-13 15:07:17,357 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 579 transitions. Word has length 71 [2024-11-13 15:07:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:17,357 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 579 transitions. [2024-11-13 15:07:17,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:07:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 579 transitions. [2024-11-13 15:07:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 15:07:17,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:17,359 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:17,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 15:07:17,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-13 15:07:17,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt [2024-11-13 15:07:17,760 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:07:17,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1416721676, now seen corresponding path program 1 times [2024-11-13 15:07:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160015165] [2024-11-13 15:07:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:17,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:07:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:07:17,763 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:07:17,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 15:07:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:18,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 15:07:18,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:07:18,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:07:19,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:19,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160015165] [2024-11-13 15:07:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160015165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:07:19,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:07:19,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-13 15:07:19,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42579524] [2024-11-13 15:07:19,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:07:19,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 15:07:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 15:07:19,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-13 15:07:19,132 INFO L87 Difference]: Start difference. First operand 537 states and 579 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:07:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:22,703 INFO L93 Difference]: Finished difference Result 561 states and 618 transitions. [2024-11-13 15:07:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 15:07:22,703 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-13 15:07:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:22,705 INFO L225 Difference]: With dead ends: 561 [2024-11-13 15:07:22,705 INFO L226 Difference]: Without dead ends: 555 [2024-11-13 15:07:22,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-13 15:07:22,707 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 22 mSDsluCounter, 5950 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6449 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:22,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6449 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:07:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-13 15:07:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-13 15:07:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 371 states have (on average 1.5498652291105122) internal successors, (575), 548 states have internal predecessors, (575), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:07:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 602 transitions. [2024-11-13 15:07:22,729 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 602 transitions. Word has length 77 [2024-11-13 15:07:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:22,730 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 602 transitions. [2024-11-13 15:07:22,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:07:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 602 transitions. [2024-11-13 15:07:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 15:07:22,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:22,731 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:22,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 15:07:22,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:07:22,936 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:07:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1942431564, now seen corresponding path program 2 times [2024-11-13 15:07:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001343032] [2024-11-13 15:07:22,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:07:22,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:07:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:07:22,940 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:07:22,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 15:07:28,748 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:07:28,749 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:07:28,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 15:07:28,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:28,920 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 15:07:28,938 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:07:28,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:07:28,981 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:07:28,990 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:07:29,108 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:07:29,118 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:07:29,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:07:29,772 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:07:29,792 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:07:29,861 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:07:29,869 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:07:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 15:07:29,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:30,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:07:30,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001343032] [2024-11-13 15:07:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001343032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:07:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [240092576] [2024-11-13 15:07:30,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:07:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:07:30,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:07:30,597 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:07:30,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-13 15:07:31,718 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:07:31,719 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:07:31,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 15:07:31,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:07:33,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:07:37,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [240092576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:07:37,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:07:37,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-13 15:07:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478384945] [2024-11-13 15:07:37,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:07:37,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-13 15:07:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-13 15:07:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-13 15:07:37,188 INFO L87 Difference]: Start difference. First operand 555 states and 602 transitions. Second operand has 58 states, 57 states have (on average 3.0) internal successors, (171), 58 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:08:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:17,262 INFO L93 Difference]: Finished difference Result 602 states and 679 transitions. [2024-11-13 15:08:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-13 15:08:17,263 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.0) internal successors, (171), 58 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 89 [2024-11-13 15:08:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:17,264 INFO L225 Difference]: With dead ends: 602 [2024-11-13 15:08:17,264 INFO L226 Difference]: Without dead ends: 590 [2024-11-13 15:08:17,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=3205, Invalid=15430, Unknown=1, NotChecked=270, Total=18906 [2024-11-13 15:08:17,268 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 466 mSDsluCounter, 7161 mSDsCounter, 0 mSdLazyCounter, 9373 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 7436 SdHoareTripleChecker+Invalid, 9404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 9373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:17,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 7436 Invalid, 9404 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 9373 Invalid, 0 Unknown, 0 Unchecked, 28.3s Time] [2024-11-13 15:08:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-13 15:08:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2024-11-13 15:08:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 407 states have (on average 1.5184275184275184) internal successors, (618), 583 states have internal predecessors, (618), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:08:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 645 transitions. [2024-11-13 15:08:17,280 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 645 transitions. Word has length 89 [2024-11-13 15:08:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:17,281 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 645 transitions. [2024-11-13 15:08:17,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.0) internal successors, (171), 58 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:08:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 645 transitions. [2024-11-13 15:08:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 15:08:17,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:17,282 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-13 15:08:17,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-13 15:08:17,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:17,683 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:08:17,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash -728611119, now seen corresponding path program 1 times [2024-11-13 15:08:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:17,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824119353] [2024-11-13 15:08:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:17,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:17,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:08:17,685 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:08:17,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 15:08:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:18,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 15:08:18,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:18,132 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 7 [2024-11-13 15:08:18,259 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:08:18,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:08:18,284 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:08:18,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:18,927 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 44 treesize of output 43 [2024-11-13 15:08:19,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:19,040 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 44 treesize of output 43 [2024-11-13 15:08:19,059 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 33 treesize of output 15 [2024-11-13 15:08:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:08:19,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:08:19,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_1539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:08:19,758 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-13 15:08:19,758 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 36 [2024-11-13 15:08:19,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1585))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1539)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-13 15:08:19,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:08:19,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824119353] [2024-11-13 15:08:19,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824119353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:08:19,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [626911409] [2024-11-13 15:08:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:08:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:08:19,775 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:08:19,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-13 15:08:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:22,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 15:08:22,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:22,679 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 15:08:22,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-13 15:08:23,113 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-13 15:08:23,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-13 15:08:23,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:08:23,530 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 34 treesize of output 16 [2024-11-13 15:08:25,339 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:25,340 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 54 treesize of output 51 [2024-11-13 15:08:25,627 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:25,627 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 54 treesize of output 51 [2024-11-13 15:08:25,672 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 43 treesize of output 19 [2024-11-13 15:08:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:08:25,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:08:26,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2001))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1539)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:08:26,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [626911409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:08:26,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:08:26,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2024-11-13 15:08:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478638224] [2024-11-13 15:08:26,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:08:26,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 15:08:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:08:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 15:08:26,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=9, NotChecked=132, Total=650 [2024-11-13 15:08:26,281 INFO L87 Difference]: Start difference. First operand 590 states and 645 transitions. Second operand has 21 states, 18 states have (on average 7.777777777777778) internal successors, (140), 20 states have internal predecessors, (140), 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:08:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:34,199 INFO L93 Difference]: Finished difference Result 1078 states and 1186 transitions. [2024-11-13 15:08:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 15:08:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.777777777777778) internal successors, (140), 20 states have internal predecessors, (140), 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 114 [2024-11-13 15:08:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:34,203 INFO L225 Difference]: With dead ends: 1078 [2024-11-13 15:08:34,203 INFO L226 Difference]: Without dead ends: 1078 [2024-11-13 15:08:34,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=1057, Unknown=13, NotChecked=210, Total=1482 [2024-11-13 15:08:34,204 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 1430 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 3090 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 3170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:34,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 2812 Invalid, 3170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3090 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-13 15:08:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-13 15:08:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 589. [2024-11-13 15:08:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 407 states have (on average 1.515970515970516) internal successors, (617), 582 states have internal predecessors, (617), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:08:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 644 transitions. [2024-11-13 15:08:34,223 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 644 transitions. Word has length 114 [2024-11-13 15:08:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:34,224 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 644 transitions. [2024-11-13 15:08:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.777777777777778) internal successors, (140), 20 states have internal predecessors, (140), 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:08:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 644 transitions. [2024-11-13 15:08:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 15:08:34,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:34,225 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:34,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-13 15:08:34,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-13 15:08:34,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:34,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:08:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -728611118, now seen corresponding path program 1 times [2024-11-13 15:08:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63609493] [2024-11-13 15:08:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:34,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:34,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:08:34,629 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:08:34,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 15:08:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:35,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-13 15:08:35,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:35,137 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 7 [2024-11-13 15:08:35,246 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 15:08:35,259 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:08:35,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:08:35,285 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:08:35,290 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:08:35,391 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:08:35,395 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:08:36,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:36,226 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:08:36,239 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:08:36,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:36,379 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:08:36,388 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:08:36,420 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:08:36,432 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:08:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:08:36,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:08:36,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2418 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2417) |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~mem34#1.base| v_ArrVal_2418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2417 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-13 15:08:36,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2417 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2418 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_2418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-13 15:08:38,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2418 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2510))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2509) .cse0 v_ArrVal_2417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2417 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2509) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-13 15:08:38,088 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:08:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63609493] [2024-11-13 15:08:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63609493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:08:38,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [832410621] [2024-11-13 15:08:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:38,089 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:08:38,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:08:38,090 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:08:38,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-13 15:08:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:41,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-13 15:08:41,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:41,179 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 7 [2024-11-13 15:08:41,338 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:08:41,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:08:41,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:08:41,367 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:08:41,377 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:08:41,456 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:08:41,463 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:08:42,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:42,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:08:42,317 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:08:42,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:42,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 62 treesize of output 57 [2024-11-13 15:08:42,397 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:08:42,428 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:08:42,435 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:08:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:08:42,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:08:42,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_2926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-13 15:08:43,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3019) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3018))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3019) .cse2 v_ArrVal_2927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-13 15:08:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [832410621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:08:44,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:08:44,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-13 15:08:44,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403023585] [2024-11-13 15:08:44,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:08:44,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:08:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:08:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:08:44,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=123, Unknown=12, NotChecked=130, Total=306 [2024-11-13 15:08:44,002 INFO L87 Difference]: Start difference. First operand 589 states and 644 transitions. Second operand has 10 states, 8 states have (on average 8.75) internal successors, (70), 10 states have internal predecessors, (70), 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:08:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:48,270 INFO L93 Difference]: Finished difference Result 588 states and 643 transitions. [2024-11-13 15:08:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:08:48,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.75) internal successors, (70), 10 states have internal predecessors, (70), 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 114 [2024-11-13 15:08:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:48,273 INFO L225 Difference]: With dead ends: 588 [2024-11-13 15:08:48,273 INFO L226 Difference]: Without dead ends: 588 [2024-11-13 15:08:48,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=240, Unknown=13, NotChecked=180, Total=506 [2024-11-13 15:08:48,273 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 392 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:48,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 992 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-13 15:08:48,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-13 15:08:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2024-11-13 15:08:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 407 states have (on average 1.5135135135135136) internal successors, (616), 581 states have internal predecessors, (616), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:08:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 643 transitions. [2024-11-13 15:08:48,285 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 643 transitions. Word has length 114 [2024-11-13 15:08:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:48,285 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 643 transitions. [2024-11-13 15:08:48,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.75) internal successors, (70), 10 states have internal predecessors, (70), 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:08:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 643 transitions. [2024-11-13 15:08:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:08:48,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:48,286 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:48,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-13 15:08:48,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-13 15:08:48,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt [2024-11-13 15:08:48,687 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:08:48,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash 711153874, now seen corresponding path program 1 times [2024-11-13 15:08:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:48,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984439929] [2024-11-13 15:08:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:48,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:48,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:08:48,690 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:08:48,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 15:08:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:49,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-13 15:08:49,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:49,218 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 7 [2024-11-13 15:08:49,377 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:08:49,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:08:49,397 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:08:50,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:50,013 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 44 treesize of output 43 [2024-11-13 15:08:50,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:50,123 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 44 treesize of output 43 [2024-11-13 15:08:50,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:50,201 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 44 treesize of output 43 [2024-11-13 15:08:50,217 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 33 treesize of output 15 [2024-11-13 15:08:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:08:50,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:08:50,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:08:50,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3394))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3395)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-13 15:08:50,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3394))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3395)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-13 15:08:50,855 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-13 15:08:50,855 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 61 treesize of output 60 [2024-11-13 15:08:50,865 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3441))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3394)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3395)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 15:08:50,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:08:50,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984439929] [2024-11-13 15:08:50,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984439929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:08:50,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354291193] [2024-11-13 15:08:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:50,868 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:08:50,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:08:50,869 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:08:50,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-13 15:08:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:56,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 15:08:56,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:56,052 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 15:08:56,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-13 15:08:56,411 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-13 15:08:56,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-13 15:08:56,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:08:56,712 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 34 treesize of output 16 [2024-11-13 15:08:58,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:58,302 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 54 treesize of output 51 [2024-11-13 15:08:58,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-13 15:08:58,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:08:58,692 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 54 treesize of output 51 [2024-11-13 15:08:58,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 43 treesize of output 19 [2024-11-13 15:08:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:08:58,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:08:58,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3395)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:08:58,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3395)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:08:59,343 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3864))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3395)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:08:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1354291193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:08:59,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:08:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22 [2024-11-13 15:08:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169236431] [2024-11-13 15:08:59,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:08:59,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 15:08:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:08:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 15:08:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=499, Unknown=13, NotChecked=364, Total=992 [2024-11-13 15:08:59,350 INFO L87 Difference]: Start difference. First operand 588 states and 643 transitions. Second operand has 23 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 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:09:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:09:08,220 INFO L93 Difference]: Finished difference Result 1074 states and 1182 transitions. [2024-11-13 15:09:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 15:09:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 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 117 [2024-11-13 15:09:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:09:08,224 INFO L225 Difference]: With dead ends: 1074 [2024-11-13 15:09:08,224 INFO L226 Difference]: Without dead ends: 1074 [2024-11-13 15:09:08,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=1256, Unknown=17, NotChecked=560, Total=2070 [2024-11-13 15:09:08,226 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 769 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:09:08,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 3301 Invalid, 3671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-13 15:09:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2024-11-13 15:09:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 587. [2024-11-13 15:09:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 407 states have (on average 1.511056511056511) internal successors, (615), 580 states have internal predecessors, (615), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:09:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 642 transitions. [2024-11-13 15:09:08,240 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 642 transitions. Word has length 117 [2024-11-13 15:09:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:09:08,240 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 642 transitions. [2024-11-13 15:09:08,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 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:09:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 642 transitions. [2024-11-13 15:09:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:09:08,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:09:08,241 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:08,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-11-13 15:09:08,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-13 15:09:08,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:09:08,642 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:09:08,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:09:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash 711153875, now seen corresponding path program 1 times [2024-11-13 15:09:08,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:09:08,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692832281] [2024-11-13 15:09:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:09:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:09:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:09:08,644 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:09:08,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-13 15:09:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:09:09,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-13 15:09:09,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:09:09,186 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 7 [2024-11-13 15:09:09,299 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:09:09,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:09:09,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:09:09,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 19 treesize of output 1 [2024-11-13 15:09:09,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:09:09,482 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:09:09,487 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:09:10,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:09:10,185 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:09:10,193 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:09:10,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:09:10,298 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:09:10,307 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:09:10,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:09:10,399 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:09:10,407 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:09:10,431 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:09:10,438 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:09:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:09:10,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:09:10,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:09:10,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-13 15:09:10,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4287))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4286) .cse0 v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4286) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-13 15:09:10,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4286) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4287))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4286) .cse3 v_ArrVal_4288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-13 15:09:14,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:09:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692832281] [2024-11-13 15:09:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692832281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:09:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1820681294] [2024-11-13 15:09:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:09:14,666 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:09:14,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:09:14,668 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:09:14,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-13 15:09:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:09:21,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-13 15:09:21,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:09:21,150 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 7 [2024-11-13 15:09:22,275 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 15:09:22,364 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:09:22,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:09:22,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:09:22,578 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 15:09:23,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 15:09:23,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 15:09:25,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 15:09:25,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 15:09:25,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 15:09:25,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 15:09:25,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 15:09:25,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 15:09:26,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 15:09:26,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 15:09:26,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 15:09:26,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:09:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 15:09:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:09:26,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:09:26,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:09:26,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-13 15:09:26,528 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4803))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4804) .cse0 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4804) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-13 15:09:26,583 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4804) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4803))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4804) .cse3 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-13 15:09:28,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4898))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4897) .cse1 v_ArrVal_4804) (select (select (store .cse2 .cse1 v_ArrVal_4803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4806))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4898))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4803))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4897) .cse4 v_ArrVal_4804) .cse5 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-13 15:09:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1820681294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:09:28,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:09:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-13 15:09:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892251725] [2024-11-13 15:09:28,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:09:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:09:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:09:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:09:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=316, Unknown=18, NotChecked=396, Total=812 [2024-11-13 15:09:28,847 INFO L87 Difference]: Start difference. First operand 587 states and 642 transitions. Second operand has 17 states, 14 states have (on average 9.785714285714286) internal successors, (137), 17 states have internal predecessors, (137), 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 15:09:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:09:47,769 INFO L93 Difference]: Finished difference Result 596 states and 652 transitions. [2024-11-13 15:09:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:09:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.785714285714286) internal successors, (137), 17 states have internal predecessors, (137), 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 117 [2024-11-13 15:09:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:09:47,775 INFO L225 Difference]: With dead ends: 596 [2024-11-13 15:09:47,775 INFO L226 Difference]: Without dead ends: 596 [2024-11-13 15:09:47,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=136, Invalid=532, Unknown=18, NotChecked=504, Total=1190 [2024-11-13 15:09:47,778 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 710 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 3193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:09:47,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1895 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3193 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2024-11-13 15:09:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-13 15:09:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 586. [2024-11-13 15:09:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 407 states have (on average 1.5085995085995085) internal successors, (614), 579 states have internal predecessors, (614), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:09:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 641 transitions. [2024-11-13 15:09:47,790 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 641 transitions. Word has length 117 [2024-11-13 15:09:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:09:47,791 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 641 transitions. [2024-11-13 15:09:47,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.785714285714286) internal successors, (137), 17 states have internal predecessors, (137), 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 15:09:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 641 transitions. [2024-11-13 15:09:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 15:09:47,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:09:47,793 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:47,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-13 15:09:48,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-13 15:09:48,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:09:48,193 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:09:48,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:09:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1088317864, now seen corresponding path program 1 times [2024-11-13 15:09:48,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:09:48,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124529005] [2024-11-13 15:09:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:09:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:09:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:09:48,197 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:09:48,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-13 15:09:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:09:48,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 15:09:48,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:09:48,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:09:49,284 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:09:49,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:09:49,338 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:09:51,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:09:51,015 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 44 treesize of output 43 [2024-11-13 15:09:51,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:09:51,334 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 44 treesize of output 43 [2024-11-13 15:09:51,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:09:51,577 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 44 treesize of output 43 [2024-11-13 15:09:51,824 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:09:51,824 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 44 treesize of output 43 [2024-11-13 15:09:51,874 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 33 treesize of output 15 [2024-11-13 15:09:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:09:51,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:09:52,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5281) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-13 15:09:52,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:09:52,154 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5280))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5281)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:09:52,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5280))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5281)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:09:52,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5279))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5280)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5281)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:09:52,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5279))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5280)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5281)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:09:53,167 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-13 15:09:53,167 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 109 treesize of output 108 [2024-11-13 15:09:53,202 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5327))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5279)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5280)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5281)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 15:09:53,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:09:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124529005] [2024-11-13 15:09:53,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124529005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:09:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [796038236] [2024-11-13 15:09:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:09:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:09:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:09:53,210 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:09:53,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-13 15:10:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:10:01,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 15:10:01,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:10:01,441 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 15:10:01,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-13 15:10:02,683 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-13 15:10:02,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-13 15:10:02,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:10:03,573 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 34 treesize of output 16 [2024-11-13 15:10:07,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:07,919 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 54 treesize of output 51 [2024-11-13 15:10:08,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:08,584 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 54 treesize of output 51 [2024-11-13 15:10:09,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:09,059 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 54 treesize of output 51 [2024-11-13 15:10:09,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:09,580 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 54 treesize of output 51 [2024-11-13 15:10:09,743 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 43 treesize of output 19 [2024-11-13 15:10:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:10:10,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:10:10,059 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5711) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-13 15:10:10,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5711) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2024-11-13 15:10:10,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5710))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5711)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:10:10,148 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5710))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5711)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:10:10,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5709))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5710)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5711)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:10:10,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5709))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5710)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5711)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:10:11,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5757 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5757))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5709)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5710)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5711)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:10:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [796038236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:10:11,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:10:11,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2024-11-13 15:10:11,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863067983] [2024-11-13 15:10:11,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:10:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 15:10:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:10:11,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 15:10:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=551, Unknown=14, NotChecked=854, Total=1560 [2024-11-13 15:10:11,071 INFO L87 Difference]: Start difference. First operand 586 states and 641 transitions. Second operand has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 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:10:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:10:35,343 INFO L93 Difference]: Finished difference Result 1070 states and 1178 transitions. [2024-11-13 15:10:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 15:10:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 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 120 [2024-11-13 15:10:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:10:35,347 INFO L225 Difference]: With dead ends: 1070 [2024-11-13 15:10:35,348 INFO L226 Difference]: Without dead ends: 1070 [2024-11-13 15:10:35,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=273, Invalid=1409, Unknown=14, NotChecked=1274, Total=2970 [2024-11-13 15:10:35,349 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1390 mSDsluCounter, 3244 mSDsCounter, 0 mSdLazyCounter, 3876 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 3495 SdHoareTripleChecker+Invalid, 3955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:10:35,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 3495 Invalid, 3955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3876 Invalid, 0 Unknown, 0 Unchecked, 22.6s Time] [2024-11-13 15:10:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-11-13 15:10:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 585. [2024-11-13 15:10:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 407 states have (on average 1.5061425061425062) internal successors, (613), 578 states have internal predecessors, (613), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:10:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 640 transitions. [2024-11-13 15:10:35,364 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 640 transitions. Word has length 120 [2024-11-13 15:10:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:10:35,364 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 640 transitions. [2024-11-13 15:10:35,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 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:10:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 640 transitions. [2024-11-13 15:10:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 15:10:35,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:10:35,366 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:35,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-13 15:10:35,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-13 15:10:35,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:10:35,767 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:10:35,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:10:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1088317863, now seen corresponding path program 1 times [2024-11-13 15:10:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:10:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992243483] [2024-11-13 15:10:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:10:35,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:10:35,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:10:35,769 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:10:35,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-13 15:10:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:10:36,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-13 15:10:36,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:10:36,412 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 7 [2024-11-13 15:10:36,914 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:10:36,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:10:36,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:10:37,021 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:10:37,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:10:37,379 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:10:37,391 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:10:39,490 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:39,490 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:10:39,520 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:10:39,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:39,906 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:10:39,928 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:10:40,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:40,205 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:10:40,229 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:10:40,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:40,509 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:10:40,540 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:10:40,604 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:10:40,624 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:10:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:10:40,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:10:41,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:10:41,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2024-11-13 15:10:41,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6187))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6188) .cse0 v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6188) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2024-11-13 15:10:41,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6188) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6187))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6188) .cse3 v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-13 15:10:42,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6185))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6187))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6186) .cse0 v_ArrVal_6188) .cse1 v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6185))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6186) .cse6 v_ArrVal_6188) (select (select (store .cse7 .cse6 v_ArrVal_6187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6189))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-13 15:10:42,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_6185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6185))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6186) .cse2 v_ArrVal_6188) (select (select (store .cse3 .cse2 v_ArrVal_6187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6189))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6185))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_6187))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6186) .cse5 v_ArrVal_6188) .cse6 v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_6190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-13 15:10:46,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6282))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_6185))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6281) .cse1 v_ArrVal_6186) .cse2 v_ArrVal_6188) (select (select (store .cse3 .cse2 v_ArrVal_6187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6189))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6282))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_6185))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_6187))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6281) .cse6 v_ArrVal_6186) .cse7 v_ArrVal_6188) .cse8 v_ArrVal_6189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_6190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-13 15:10:46,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:10:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992243483] [2024-11-13 15:10:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992243483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:10:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1853754692] [2024-11-13 15:10:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:10:46,401 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:10:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:10:46,403 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:10:46,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-13 15:10:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:10:54,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-13 15:10:54,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:10:54,278 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 7 [2024-11-13 15:10:54,774 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 15:10:54,826 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:10:54,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:10:54,861 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:10:54,885 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:10:55,061 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:10:55,073 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:10:57,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:57,194 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:10:57,223 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:10:57,439 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:57,439 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:10:57,462 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:10:57,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:57,627 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:10:57,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:10:57,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:10:57,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 15:10:57,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 30 treesize of output 13 [2024-11-13 15:10:57,917 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:10:57,939 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:10:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:10:57,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:10:58,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-13 15:10:58,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6712) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6713))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6712) .cse2 v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-13 15:10:58,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6713))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6712) .cse1 v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6712) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-13 15:10:58,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6711))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6710) .cse1 v_ArrVal_6712) (select (select (store .cse2 .cse1 v_ArrVal_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6715))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6711))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6713))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6710) .cse4 v_ArrVal_6712) .cse5 v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-13 15:10:58,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6711))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6713))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6710) .cse1 v_ArrVal_6712) .cse2 v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6711))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6710) .cse7 v_ArrVal_6712) (select (select (store .cse8 .cse7 v_ArrVal_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6715))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-13 15:11:05,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6806))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_6711))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6807) .cse1 v_ArrVal_6710) .cse2 v_ArrVal_6712) (select (select (store .cse3 .cse2 v_ArrVal_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6715))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6806))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_6711))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_6713))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6807) .cse6 v_ArrVal_6710) .cse7 v_ArrVal_6712) .cse8 v_ArrVal_6715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_6714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-13 15:11:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1853754692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:11:05,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:11:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-13 15:11:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548218618] [2024-11-13 15:11:05,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:11:05,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:11:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:11:05,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:11:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=179, Unknown=18, NotChecked=494, Total=756 [2024-11-13 15:11:05,612 INFO L87 Difference]: Start difference. First operand 585 states and 640 transitions. Second operand has 12 states, 10 states have (on average 7.6) internal successors, (76), 12 states have internal predecessors, (76), 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:11:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:43,500 INFO L93 Difference]: Finished difference Result 584 states and 639 transitions. [2024-11-13 15:11:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:11:43,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.6) internal successors, (76), 12 states have internal predecessors, (76), 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 120 [2024-11-13 15:11:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:43,502 INFO L225 Difference]: With dead ends: 584 [2024-11-13 15:11:43,502 INFO L226 Difference]: Without dead ends: 584 [2024-11-13 15:11:43,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 235 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=111, Invalid=385, Unknown=18, NotChecked=676, Total=1190 [2024-11-13 15:11:43,503 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 388 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:43,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1002 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 34.8s Time] [2024-11-13 15:11:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-13 15:11:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2024-11-13 15:11:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 407 states have (on average 1.5036855036855037) internal successors, (612), 577 states have internal predecessors, (612), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:11:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 639 transitions. [2024-11-13 15:11:43,517 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 639 transitions. Word has length 120 [2024-11-13 15:11:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:43,518 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 639 transitions. [2024-11-13 15:11:43,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.6) internal successors, (76), 12 states have internal predecessors, (76), 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:11:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 639 transitions. [2024-11-13 15:11:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 15:11:43,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:43,519 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:43,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-13 15:11:43,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-13 15:11:43,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt [2024-11-13 15:11:43,920 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:11:43,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1915975142, now seen corresponding path program 1 times [2024-11-13 15:11:43,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:11:43,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242105414] [2024-11-13 15:11:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:43,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:11:43,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:11:43,923 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:11:43,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-13 15:11:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:44,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-13 15:11:44,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:11:46,918 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:11:46,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:11:47,171 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:11:54,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:11:54,154 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 44 treesize of output 43 [2024-11-13 15:11:55,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:11:55,471 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 44 treesize of output 43 [2024-11-13 15:11:56,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:11:56,523 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 44 treesize of output 43 [2024-11-13 15:11:57,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:11:57,595 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 44 treesize of output 43 [2024-11-13 15:11:58,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:11:58,701 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 44 treesize of output 43 [2024-11-13 15:11:58,913 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 33 treesize of output 15 [2024-11-13 15:11:59,857 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 15:11:59,858 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 21 treesize of output 20 [2024-11-13 15:11:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:11:59,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:12:01,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:12:02,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7197))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:02,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7197))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:02,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7196))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:02,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7196))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:02,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7195))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7196)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:02,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7195))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7196)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-13 15:12:05,674 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2024-11-13 15:12:05,675 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 205 treesize of output 204 [2024-11-13 15:12:05,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7245))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7195)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7196)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-13 15:12:05,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:12:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242105414] [2024-11-13 15:12:05,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242105414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:12:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2105644231] [2024-11-13 15:12:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:12:05,787 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:12:05,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:12:05,789 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:12:05,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-13 15:12:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:12:10,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-13 15:12:10,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:12:11,590 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 15:12:11,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-13 15:12:17,026 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-13 15:12:17,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-13 15:12:18,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:12:20,939 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 34 treesize of output 16 [2024-11-13 15:12:39,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:12:39,178 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 54 treesize of output 51 [2024-11-13 15:12:41,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:12:41,942 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 54 treesize of output 51 [2024-11-13 15:12:43,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:12:43,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 54 treesize of output 51 [2024-11-13 15:12:45,582 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:12:45,582 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 54 treesize of output 51 [2024-11-13 15:12:47,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:12:47,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 54 treesize of output 51 [2024-11-13 15:12:47,908 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 43 treesize of output 19 [2024-11-13 15:12:50,219 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2024-11-13 15:12:50,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 52 [2024-11-13 15:12:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:12:50,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:12:51,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7638) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-11-13 15:12:51,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 15:12:51,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7637))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7638)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:51,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7637))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7638)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-13 15:12:51,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7636))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7637)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7638)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:51,929 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7636))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7637)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7638)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:52,076 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7635))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7636)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7637)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7638)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:52,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7635))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7636)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7637)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7638)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 15:12:55,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2105644231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:12:55,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:12:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2024-11-13 15:12:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459169624] [2024-11-13 15:12:55,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:12:55,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 15:12:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:12:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 15:12:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=796, Unknown=22, NotChecked=1168, Total=2162 [2024-11-13 15:12:55,813 INFO L87 Difference]: Start difference. First operand 584 states and 639 transitions. Second operand has 28 states, 25 states have (on average 6.4) internal successors, (160), 26 states have internal predecessors, (160), 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:14:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:14:06,707 INFO L93 Difference]: Finished difference Result 1066 states and 1174 transitions. [2024-11-13 15:14:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 15:14:06,707 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.4) internal successors, (160), 26 states have internal predecessors, (160), 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 124 [2024-11-13 15:14:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:14:06,711 INFO L225 Difference]: With dead ends: 1066 [2024-11-13 15:14:06,711 INFO L226 Difference]: Without dead ends: 1066 [2024-11-13 15:14:06,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 232 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=309, Invalid=1710, Unknown=25, NotChecked=1616, Total=3660 [2024-11-13 15:14:06,712 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1382 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:14:06,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 2604 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 64.7s Time] [2024-11-13 15:14:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2024-11-13 15:14:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 583. [2024-11-13 15:14:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 407 states have (on average 1.5012285012285012) internal successors, (611), 576 states have internal predecessors, (611), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 15:14:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 638 transitions. [2024-11-13 15:14:06,726 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 638 transitions. Word has length 124 [2024-11-13 15:14:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:14:06,726 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 638 transitions. [2024-11-13 15:14:06,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.4) internal successors, (160), 26 states have internal predecessors, (160), 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:14:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 638 transitions. [2024-11-13 15:14:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 15:14:06,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:14:06,728 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:06,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-13 15:14:06,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2024-11-13 15:14:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt [2024-11-13 15:14:07,129 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 15:14:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1915975141, now seen corresponding path program 1 times [2024-11-13 15:14:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:14:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998794711] [2024-11-13 15:14:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:14:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:14:07,131 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:14:07,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf736742-c404-4f3d-aa34-812ae69e079b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-13 15:14:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:07,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-13 15:14:07,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:14:07,895 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 7 [2024-11-13 15:14:10,321 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:14:10,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:14:10,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:14:10,797 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:14:10,841 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:14:12,165 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:14:12,209 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:14:23,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:14:23,982 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 75 treesize of output 68 [2024-11-13 15:14:24,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 15:14:26,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:14:26,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-13 15:14:26,151 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:14:27,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:14:27,725 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 75 treesize of output 68 [2024-11-13 15:14:27,813 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:14:29,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:14:29,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 75 treesize of output 68 [2024-11-13 15:14:29,502 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:14:31,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 15:14:31,174 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 75 treesize of output 68 [2024-11-13 15:14:31,261 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:14:31,735 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 44 treesize of output 20 [2024-11-13 15:14:31,860 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:14:32,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:14:32,866 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-13 15:14:32,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-13 15:14:33,094 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:14:33,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:14:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-13 15:14:33,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:14:39,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8127 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8129 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_8129) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-13 15:14:43,583 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8126) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8129 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8125))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8126) .cse2 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_8129) (select (select (store .cse3 .cse2 v_ArrVal_8127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false [2024-11-13 15:14:43,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8126) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8129 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8125))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8126) .cse3 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_8129) (select (select (store .cse4 .cse3 v_ArrVal_8127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-13 15:14:46,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8129 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8124))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8125))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8123) .cse0 v_ArrVal_8126) .cse1 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_8129) (select (select (store .cse3 .cse1 v_ArrVal_8127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8124))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8123) .cse6 v_ArrVal_8126) (select (select (store .cse7 .cse6 v_ArrVal_8125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8128))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2024-11-13 15:14:46,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8124))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8123) .cse2 v_ArrVal_8126) (select (select (store .cse3 .cse2 v_ArrVal_8125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8128))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8129 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8124))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_8125))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8123) .cse5 v_ArrVal_8126) .cse6 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_8129) (select (select (store .cse7 .cse6 v_ArrVal_8127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-13 15:14:52,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8121 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_8129 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8122))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8124))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8125))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8121) .cse0 v_ArrVal_8123) .cse1 v_ArrVal_8126) .cse2 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_8129) (select (select (store .cse4 .cse2 v_ArrVal_8127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_8122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8122))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8124))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8121) .cse8 v_ArrVal_8123) .cse9 v_ArrVal_8126) (select (select (store .cse10 .cse9 v_ArrVal_8125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8128))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2024-11-13 15:14:53,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8121 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8129 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8122))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8124))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8125))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8121) .cse1 v_ArrVal_8123) .cse2 v_ArrVal_8126) .cse3 v_ArrVal_8128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_8129) (select (select (store .cse5 .cse3 v_ArrVal_8127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_8122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8122))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_8124))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8121) .cse9 v_ArrVal_8123) .cse10 v_ArrVal_8126) (select (select (store .cse11 .cse10 v_ArrVal_8125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8128))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-13 15:15:03,967 WARN L286 SmtUtils]: Spent 10.34s on a formula simplification that was a NOOP. DAG size: 362 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)