./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:22:52,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:22:52,179 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:22:52,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:22:52,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:22:52,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:22:52,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:22:52,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:22:52,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:22:52,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:22:52,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:22:52,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:22:52,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:22:52,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:22:52,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:22:52,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:22:52,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:22:52,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:22:52,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:22:52,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:22:52,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:22:52,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:22:52,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:22:52,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:22:52,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:22:52,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:22:52,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:22:52,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:22:52,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:22:52,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:22:52,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:22:52,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:22:52,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:22:52,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:22:52,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:22:52,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:22:52,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:22:52,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:22:52,225 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_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e [2024-11-28 02:22:52,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:22:52,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:22:52,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:22:52,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:22:52,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:22:52,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2024-11-28 02:22:55,611 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/c103ae8f8/39aa2e8193fe46db871f0ac08220f0d4/FLAG5b0619133 [2024-11-28 02:22:56,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:22:56,003 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2024-11-28 02:22:56,021 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/c103ae8f8/39aa2e8193fe46db871f0ac08220f0d4/FLAG5b0619133 [2024-11-28 02:22:56,041 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/c103ae8f8/39aa2e8193fe46db871f0ac08220f0d4 [2024-11-28 02:22:56,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:22:56,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:22:56,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:22:56,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:22:56,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:22:56,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:22:56" (1/1) ... [2024-11-28 02:22:56,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51aba4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:56, skipping insertion in model container [2024-11-28 02:22:56,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:22:56" (1/1) ... [2024-11-28 02:22:56,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:22:56,707 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,744 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,748 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,753 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,761 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,831 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,831 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,837 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,837 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:22:56,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:22:56,874 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:22:57,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:22:57,058 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:22:57,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57 WrapperNode [2024-11-28 02:22:57,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:22:57,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:22:57,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:22:57,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:22:57,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,179 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-28 02:22:57,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:22:57,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:22:57,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:22:57,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:22:57,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,287 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [172, 2, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [42, 0, 4]. [2024-11-28 02:22:57,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:22:57,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:22:57,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:22:57,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:22:57,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (1/1) ... [2024-11-28 02:22:57,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:22:57,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:22:57,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:22:57,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:22:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 02:22:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 02:22:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:22:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:22:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 02:22:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:22:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:22:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 02:22:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:22:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:22:57,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:22:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:22:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:22:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:22:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:22:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:22:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:22:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:22:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:22:57,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:22:57,802 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:22:57,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:22:57,831 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:22:57,871 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:22:57,902 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:23:00,669 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-28 02:23:00,669 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:23:00,700 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:23:00,700 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-28 02:23:00,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:23:00 BoogieIcfgContainer [2024-11-28 02:23:00,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:23:00,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:23:00,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:23:00,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:23:00,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:22:56" (1/3) ... [2024-11-28 02:23:00,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152a119f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:23:00, skipping insertion in model container [2024-11-28 02:23:00,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:22:57" (2/3) ... [2024-11-28 02:23:00,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152a119f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:23:00, skipping insertion in model container [2024-11-28 02:23:00,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:23:00" (3/3) ... [2024-11-28 02:23:00,711 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-1.i [2024-11-28 02:23:00,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:23:00,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test2-1.i that has 6 procedures, 1087 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2024-11-28 02:23:00,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:23:00,830 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;@2b3a008f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:23:00,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-28 02:23:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 1077 states, 642 states have (on average 2.0109034267912773) internal successors, (1291), 1070 states have internal predecessors, (1291), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-28 02:23:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:23:00,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:00,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:23:00,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:00,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-28 02:23:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:00,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751577070] [2024-11-28 02:23:00,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:00,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751577070] [2024-11-28 02:23:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751577070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:23:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818789503] [2024-11-28 02:23:01,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:01,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:23:01,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:01,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:23:01,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:01,153 INFO L87 Difference]: Start difference. First operand has 1077 states, 642 states have (on average 2.0109034267912773) internal successors, (1291), 1070 states have internal predecessors, (1291), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:02,104 INFO L93 Difference]: Finished difference Result 1063 states and 1237 transitions. [2024-11-28 02:23:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:23:02,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 02:23:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:02,130 INFO L225 Difference]: With dead ends: 1063 [2024-11-28 02:23:02,130 INFO L226 Difference]: Without dead ends: 1061 [2024-11-28 02:23:02,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:02,139 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 1102 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:02,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 900 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:23:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-28 02:23:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2024-11-28 02:23:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 644 states have (on average 1.889751552795031) internal successors, (1217), 1054 states have internal predecessors, (1217), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-28 02:23:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1235 transitions. [2024-11-28 02:23:02,264 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1235 transitions. Word has length 3 [2024-11-28 02:23:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:02,264 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1235 transitions. [2024-11-28 02:23:02,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1235 transitions. [2024-11-28 02:23:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:23:02,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:02,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:23:02,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:23:02,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-28 02:23:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381707289] [2024-11-28 02:23:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381707289] [2024-11-28 02:23:02,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381707289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:02,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:02,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:23:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041235880] [2024-11-28 02:23:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:02,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:23:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:02,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:23:02,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:02,409 INFO L87 Difference]: Start difference. First operand 1061 states and 1235 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:03,602 INFO L93 Difference]: Finished difference Result 1836 states and 2172 transitions. [2024-11-28 02:23:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:23:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 02:23:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:03,611 INFO L225 Difference]: With dead ends: 1836 [2024-11-28 02:23:03,611 INFO L226 Difference]: Without dead ends: 1836 [2024-11-28 02:23:03,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:03,613 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 919 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:03,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1746 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 02:23:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-28 02:23:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1572. [2024-11-28 02:23:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1151 states have (on average 1.8505647263249347) internal successors, (2130), 1563 states have internal predecessors, (2130), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2162 transitions. [2024-11-28 02:23:03,685 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2162 transitions. Word has length 3 [2024-11-28 02:23:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:03,685 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2162 transitions. [2024-11-28 02:23:03,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2162 transitions. [2024-11-28 02:23:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:23:03,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:03,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:03,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:23:03,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:03,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2024-11-28 02:23:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727823018] [2024-11-28 02:23:03,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:03,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727823018] [2024-11-28 02:23:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727823018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:23:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758172858] [2024-11-28 02:23:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:03,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:23:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:03,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:23:03,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:03,853 INFO L87 Difference]: Start difference. First operand 1572 states and 2162 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:04,744 INFO L93 Difference]: Finished difference Result 1846 states and 2500 transitions. [2024-11-28 02:23:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:23:04,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:23:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:04,753 INFO L225 Difference]: With dead ends: 1846 [2024-11-28 02:23:04,753 INFO L226 Difference]: Without dead ends: 1846 [2024-11-28 02:23:04,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:04,759 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 1087 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:04,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1504 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:23:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-28 02:23:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1525. [2024-11-28 02:23:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1151 states have (on average 1.788879235447437) internal successors, (2059), 1516 states have internal predecessors, (2059), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2091 transitions. [2024-11-28 02:23:04,813 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2091 transitions. Word has length 9 [2024-11-28 02:23:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:04,814 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2091 transitions. [2024-11-28 02:23:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2091 transitions. [2024-11-28 02:23:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:23:04,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:04,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:04,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:23:04,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:04,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2024-11-28 02:23:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:04,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853483941] [2024-11-28 02:23:04,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:05,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853483941] [2024-11-28 02:23:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853483941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:05,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:05,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:23:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633806449] [2024-11-28 02:23:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:05,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:23:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:05,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:23:05,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:05,015 INFO L87 Difference]: Start difference. First operand 1525 states and 2091 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:05,908 INFO L93 Difference]: Finished difference Result 2067 states and 2869 transitions. [2024-11-28 02:23:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:23:05,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:23:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:05,918 INFO L225 Difference]: With dead ends: 2067 [2024-11-28 02:23:05,918 INFO L226 Difference]: Without dead ends: 2067 [2024-11-28 02:23:05,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:05,920 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 879 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:05,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1754 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:23:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2024-11-28 02:23:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1500. [2024-11-28 02:23:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1151 states have (on average 1.7463075586446568) internal successors, (2010), 1491 states have internal predecessors, (2010), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2042 transitions. [2024-11-28 02:23:05,979 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2042 transitions. Word has length 9 [2024-11-28 02:23:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:05,979 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 2042 transitions. [2024-11-28 02:23:05,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2042 transitions. [2024-11-28 02:23:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 02:23:05,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:05,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:23:05,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:05,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1246154765, now seen corresponding path program 1 times [2024-11-28 02:23:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282167326] [2024-11-28 02:23:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282167326] [2024-11-28 02:23:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282167326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:06,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:06,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:23:06,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285465479] [2024-11-28 02:23:06,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:06,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:23:06,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:06,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:23:06,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:23:06,140 INFO L87 Difference]: Start difference. First operand 1500 states and 2042 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:06,392 INFO L93 Difference]: Finished difference Result 2685 states and 3581 transitions. [2024-11-28 02:23:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:23:06,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 02:23:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:06,403 INFO L225 Difference]: With dead ends: 2685 [2024-11-28 02:23:06,403 INFO L226 Difference]: Without dead ends: 2685 [2024-11-28 02:23:06,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:23:06,404 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 1101 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:06,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 3311 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:23:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-11-28 02:23:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 1502. [2024-11-28 02:23:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1153 states have (on average 1.7450130095403296) internal successors, (2012), 1493 states have internal predecessors, (2012), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2044 transitions. [2024-11-28 02:23:06,452 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2044 transitions. Word has length 10 [2024-11-28 02:23:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:06,454 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2044 transitions. [2024-11-28 02:23:06,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2044 transitions. [2024-11-28 02:23:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 02:23:06,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:06,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:06,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:23:06,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:06,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash 495195041, now seen corresponding path program 1 times [2024-11-28 02:23:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051839876] [2024-11-28 02:23:06,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051839876] [2024-11-28 02:23:06,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051839876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:06,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:06,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:23:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817427076] [2024-11-28 02:23:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:06,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:23:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:06,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:23:06,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:23:06,583 INFO L87 Difference]: Start difference. First operand 1502 states and 2044 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:07,510 INFO L93 Difference]: Finished difference Result 1578 states and 2151 transitions. [2024-11-28 02:23:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:23:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-28 02:23:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:07,517 INFO L225 Difference]: With dead ends: 1578 [2024-11-28 02:23:07,517 INFO L226 Difference]: Without dead ends: 1578 [2024-11-28 02:23:07,518 INFO L434 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-28 02:23:07,519 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1352 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:07,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1363 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:23:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-28 02:23:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1479. [2024-11-28 02:23:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1153 states have (on average 1.705117085862966) internal successors, (1966), 1470 states have internal predecessors, (1966), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1998 transitions. [2024-11-28 02:23:07,571 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1998 transitions. Word has length 19 [2024-11-28 02:23:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:07,571 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1998 transitions. [2024-11-28 02:23:07,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1998 transitions. [2024-11-28 02:23:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 02:23:07,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:07,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:23:07,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:07,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash 495195042, now seen corresponding path program 1 times [2024-11-28 02:23:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:07,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390105904] [2024-11-28 02:23:07,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:07,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390105904] [2024-11-28 02:23:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390105904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:07,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:23:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513564038] [2024-11-28 02:23:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:07,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:23:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:07,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:23:07,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:07,707 INFO L87 Difference]: Start difference. First operand 1479 states and 1998 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:07,754 INFO L93 Difference]: Finished difference Result 1341 states and 1792 transitions. [2024-11-28 02:23:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:23:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-28 02:23:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:07,760 INFO L225 Difference]: With dead ends: 1341 [2024-11-28 02:23:07,760 INFO L226 Difference]: Without dead ends: 1341 [2024-11-28 02:23:07,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:07,761 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 61 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1977 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-28 02:23:07,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1977 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:23:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-28 02:23:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2024-11-28 02:23:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1027 states have (on average 1.7137293086660175) internal successors, (1760), 1332 states have internal predecessors, (1760), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1792 transitions. [2024-11-28 02:23:07,799 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1792 transitions. Word has length 19 [2024-11-28 02:23:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:07,800 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1792 transitions. [2024-11-28 02:23:07,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1792 transitions. [2024-11-28 02:23:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 02:23:07,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:07,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:07,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:23:07,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:07,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash -858657125, now seen corresponding path program 1 times [2024-11-28 02:23:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:07,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162285048] [2024-11-28 02:23:07,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162285048] [2024-11-28 02:23:07,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162285048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:07,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:07,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:23:07,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324191681] [2024-11-28 02:23:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:07,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:23:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:07,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:23:07,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:23:07,896 INFO L87 Difference]: Start difference. First operand 1341 states and 1792 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:07,966 INFO L93 Difference]: Finished difference Result 1312 states and 1742 transitions. [2024-11-28 02:23:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:23:07,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-28 02:23:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:07,974 INFO L225 Difference]: With dead ends: 1312 [2024-11-28 02:23:07,976 INFO L226 Difference]: Without dead ends: 1312 [2024-11-28 02:23:07,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:23:07,976 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 41 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2912 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-28 02:23:07,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2912 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:23:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-28 02:23:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2024-11-28 02:23:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 999 states have (on average 1.7057057057057057) internal successors, (1704), 1297 states have internal predecessors, (1704), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1736 transitions. [2024-11-28 02:23:08,007 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1736 transitions. Word has length 21 [2024-11-28 02:23:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:08,008 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1736 transitions. [2024-11-28 02:23:08,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1736 transitions. [2024-11-28 02:23:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:23:08,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:08,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:08,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:23:08,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:08,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash -496287351, now seen corresponding path program 1 times [2024-11-28 02:23:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:08,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476226283] [2024-11-28 02:23:08,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:08,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:08,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476226283] [2024-11-28 02:23:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476226283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:08,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:23:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868249205] [2024-11-28 02:23:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:08,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:23:08,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:08,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:23:08,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:23:08,255 INFO L87 Difference]: Start difference. First operand 1306 states and 1736 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:09,320 INFO L93 Difference]: Finished difference Result 2102 states and 2887 transitions. [2024-11-28 02:23:09,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:23:09,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-28 02:23:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:09,328 INFO L225 Difference]: With dead ends: 2102 [2024-11-28 02:23:09,328 INFO L226 Difference]: Without dead ends: 2102 [2024-11-28 02:23:09,328 INFO L434 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-28 02:23:09,330 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 828 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:09,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1926 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:23:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2024-11-28 02:23:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1302. [2024-11-28 02:23:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 999 states have (on average 1.6976976976976976) internal successors, (1696), 1293 states have internal predecessors, (1696), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1728 transitions. [2024-11-28 02:23:09,396 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1728 transitions. Word has length 35 [2024-11-28 02:23:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:09,397 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1728 transitions. [2024-11-28 02:23:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1728 transitions. [2024-11-28 02:23:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 02:23:09,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:09,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:09,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:23:09,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:09,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -907140769, now seen corresponding path program 1 times [2024-11-28 02:23:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737453677] [2024-11-28 02:23:09,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:09,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737453677] [2024-11-28 02:23:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737453677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:09,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:23:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26012686] [2024-11-28 02:23:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:09,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:23:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:09,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:23:09,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:23:09,593 INFO L87 Difference]: Start difference. First operand 1302 states and 1728 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-28 02:23:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:09,664 INFO L93 Difference]: Finished difference Result 1302 states and 1720 transitions. [2024-11-28 02:23:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:23:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-28 02:23:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:09,671 INFO L225 Difference]: With dead ends: 1302 [2024-11-28 02:23:09,672 INFO L226 Difference]: Without dead ends: 1302 [2024-11-28 02:23:09,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:23:09,673 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 21 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2894 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-28 02:23:09,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2894 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:23:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-28 02:23:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2024-11-28 02:23:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 999 states have (on average 1.6896896896896898) internal successors, (1688), 1293 states have internal predecessors, (1688), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:23:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1720 transitions. [2024-11-28 02:23:09,712 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1720 transitions. Word has length 69 [2024-11-28 02:23:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:09,713 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1720 transitions. [2024-11-28 02:23:09,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-28 02:23:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1720 transitions. [2024-11-28 02:23:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-28 02:23:09,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:09,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:09,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:23:09,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1031867989, now seen corresponding path program 1 times [2024-11-28 02:23:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498384665] [2024-11-28 02:23:09,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498384665] [2024-11-28 02:23:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498384665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:09,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:23:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078007377] [2024-11-28 02:23:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:09,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:23:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:09,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:23:09,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:09,964 INFO L87 Difference]: Start difference. First operand 1302 states and 1720 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-28 02:23:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:10,052 INFO L93 Difference]: Finished difference Result 1833 states and 2483 transitions. [2024-11-28 02:23:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:23:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-28 02:23:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:10,060 INFO L225 Difference]: With dead ends: 1833 [2024-11-28 02:23:10,062 INFO L226 Difference]: Without dead ends: 1833 [2024-11-28 02:23:10,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:23:10,063 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 364 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:10,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:23:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2024-11-28 02:23:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1776. [2024-11-28 02:23:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1463 states have (on average 1.6596035543403964) internal successors, (2428), 1767 states have internal predecessors, (2428), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:23:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2480 transitions. [2024-11-28 02:23:10,105 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2480 transitions. Word has length 77 [2024-11-28 02:23:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:10,105 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2480 transitions. [2024-11-28 02:23:10,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-28 02:23:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2480 transitions. [2024-11-28 02:23:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 02:23:10,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:10,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:23:10,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:10,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash 646450878, now seen corresponding path program 1 times [2024-11-28 02:23:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110863279] [2024-11-28 02:23:10,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:10,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110863279] [2024-11-28 02:23:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110863279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:23:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228743785] [2024-11-28 02:23:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:10,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:23:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:10,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:23:10,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:23:10,633 INFO L87 Difference]: Start difference. First operand 1776 states and 2480 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:11,626 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2024-11-28 02:23:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:23:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-28 02:23:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:11,635 INFO L225 Difference]: With dead ends: 1775 [2024-11-28 02:23:11,635 INFO L226 Difference]: Without dead ends: 1775 [2024-11-28 02:23:11,635 INFO L434 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-28 02:23:11,636 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 2 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:11,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2953 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:23:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2024-11-28 02:23:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2024-11-28 02:23:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1463 states have (on average 1.6582365003417634) internal successors, (2426), 1766 states have internal predecessors, (2426), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:23:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2478 transitions. [2024-11-28 02:23:11,680 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2478 transitions. Word has length 85 [2024-11-28 02:23:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:11,680 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2478 transitions. [2024-11-28 02:23:11,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2478 transitions. [2024-11-28 02:23:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 02:23:11,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:11,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:11,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:23:11,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:11,682 INFO L85 PathProgramCache]: Analyzing trace with hash 646450879, now seen corresponding path program 1 times [2024-11-28 02:23:11,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:11,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869413741] [2024-11-28 02:23:11,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:11,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:12,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:12,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869413741] [2024-11-28 02:23:12,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869413741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:12,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:12,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:23:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965060795] [2024-11-28 02:23:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:12,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:23:12,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:12,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:23:12,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:23:12,408 INFO L87 Difference]: Start difference. First operand 1775 states and 2478 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:13,470 INFO L93 Difference]: Finished difference Result 1774 states and 2476 transitions. [2024-11-28 02:23:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:23:13,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-28 02:23:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:13,477 INFO L225 Difference]: With dead ends: 1774 [2024-11-28 02:23:13,477 INFO L226 Difference]: Without dead ends: 1774 [2024-11-28 02:23:13,477 INFO L434 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-28 02:23:13,478 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 1 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:13,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2891 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:23:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-28 02:23:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1774. [2024-11-28 02:23:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1461 states have (on average 1.6591375770020533) internal successors, (2424), 1765 states have internal predecessors, (2424), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:23:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2476 transitions. [2024-11-28 02:23:13,520 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2476 transitions. Word has length 85 [2024-11-28 02:23:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2476 transitions. [2024-11-28 02:23:13,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:23:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2476 transitions. [2024-11-28 02:23:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:23:13,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:13,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:13,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:23:13,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2130907205, now seen corresponding path program 1 times [2024-11-28 02:23:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341081297] [2024-11-28 02:23:13,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:13,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:13,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341081297] [2024-11-28 02:23:13,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341081297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:13,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:13,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:23:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690347842] [2024-11-28 02:23:13,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:13,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:23:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:13,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:23:13,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:23:13,886 INFO L87 Difference]: Start difference. First operand 1774 states and 2476 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-28 02:23:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:15,080 INFO L93 Difference]: Finished difference Result 1792 states and 2502 transitions. [2024-11-28 02:23:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:23:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2024-11-28 02:23:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:15,091 INFO L225 Difference]: With dead ends: 1792 [2024-11-28 02:23:15,091 INFO L226 Difference]: Without dead ends: 1792 [2024-11-28 02:23:15,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:23:15,092 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 13 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4565 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:15,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4565 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 02:23:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-28 02:23:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1783. [2024-11-28 02:23:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1469 states have (on average 1.6575901974132063) internal successors, (2435), 1772 states have internal predecessors, (2435), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-28 02:23:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2492 transitions. [2024-11-28 02:23:15,144 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2492 transitions. Word has length 93 [2024-11-28 02:23:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2492 transitions. [2024-11-28 02:23:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-28 02:23:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2492 transitions. [2024-11-28 02:23:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:23:15,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:15,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:23:15,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2130907206, now seen corresponding path program 1 times [2024-11-28 02:23:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800914856] [2024-11-28 02:23:15,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:16,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800914856] [2024-11-28 02:23:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800914856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:16,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:16,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:23:16,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163319877] [2024-11-28 02:23:16,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:16,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:23:16,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:16,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:23:16,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:23:16,027 INFO L87 Difference]: Start difference. First operand 1783 states and 2492 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-28 02:23:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:17,251 INFO L93 Difference]: Finished difference Result 1783 states and 2490 transitions. [2024-11-28 02:23:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:23:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2024-11-28 02:23:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:17,261 INFO L225 Difference]: With dead ends: 1783 [2024-11-28 02:23:17,262 INFO L226 Difference]: Without dead ends: 1783 [2024-11-28 02:23:17,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:23:17,267 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 8 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:17,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3692 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 02:23:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-11-28 02:23:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2024-11-28 02:23:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1469 states have (on average 1.6562287270251872) internal successors, (2433), 1772 states have internal predecessors, (2433), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-28 02:23:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2490 transitions. [2024-11-28 02:23:17,303 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2490 transitions. Word has length 93 [2024-11-28 02:23:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:17,303 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2490 transitions. [2024-11-28 02:23:17,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-28 02:23:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2490 transitions. [2024-11-28 02:23:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 02:23:17,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:17,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:17,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:23:17,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:17,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2107272152, now seen corresponding path program 1 times [2024-11-28 02:23:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453746856] [2024-11-28 02:23:17,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453746856] [2024-11-28 02:23:18,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453746856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314365714] [2024-11-28 02:23:18,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:18,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:18,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:23:18,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:23:18,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:23:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:18,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 02:23:18,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:23:18,524 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:23:18,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:23:18,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:18,691 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-28 02:23:18,926 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:18,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:23:19,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:23:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:19,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:23:19,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:23:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314365714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:19,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:23:19,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-28 02:23:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518791371] [2024-11-28 02:23:19,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:23:19,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:23:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:19,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:23:19,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-28 02:23:19,102 INFO L87 Difference]: Start difference. First operand 1783 states and 2490 transitions. Second operand has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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-28 02:23:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:22,136 INFO L93 Difference]: Finished difference Result 1790 states and 2496 transitions. [2024-11-28 02:23:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:23:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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 94 [2024-11-28 02:23:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:22,147 INFO L225 Difference]: With dead ends: 1790 [2024-11-28 02:23:22,148 INFO L226 Difference]: Without dead ends: 1790 [2024-11-28 02:23:22,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2024-11-28 02:23:22,148 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 918 mSDsluCounter, 6182 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 6821 SdHoareTripleChecker+Invalid, 4073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:22,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 6821 Invalid, 4073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-28 02:23:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-28 02:23:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1787. [2024-11-28 02:23:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1473 states have (on average 1.6537678207739308) internal successors, (2436), 1775 states have internal predecessors, (2436), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:23:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2490 transitions. [2024-11-28 02:23:22,185 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2490 transitions. Word has length 94 [2024-11-28 02:23:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:22,185 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2490 transitions. [2024-11-28 02:23:22,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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-28 02:23:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2490 transitions. [2024-11-28 02:23:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 02:23:22,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:22,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:22,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:23:22,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:22,390 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:22,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2107272151, now seen corresponding path program 1 times [2024-11-28 02:23:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:22,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436639471] [2024-11-28 02:23:22,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:23,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:23,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436639471] [2024-11-28 02:23:23,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436639471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:23,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656781856] [2024-11-28 02:23:23,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:23,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:23:23,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:23:23,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:23:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:23,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 02:23:23,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:23:23,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:23:23,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:23:23,868 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-28 02:23:23,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:23:23,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:23,999 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-28 02:23:24,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:23:24,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:24,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:23:24,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:23:24,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:23:24,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:23:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:24,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:23:24,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_730 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:23:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656781856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:24,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:23:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2024-11-28 02:23:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508216007] [2024-11-28 02:23:24,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:23:24,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:23:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:24,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:23:24,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-28 02:23:24,329 INFO L87 Difference]: Start difference. First operand 1787 states and 2490 transitions. Second operand has 15 states, 12 states have (on average 9.416666666666666) internal successors, (113), 15 states have internal predecessors, (113), 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-28 02:23:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:26,420 INFO L93 Difference]: Finished difference Result 1789 states and 2494 transitions. [2024-11-28 02:23:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:23:26,421 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.416666666666666) internal successors, (113), 15 states have internal predecessors, (113), 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 94 [2024-11-28 02:23:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:26,426 INFO L225 Difference]: With dead ends: 1789 [2024-11-28 02:23:26,426 INFO L226 Difference]: Without dead ends: 1789 [2024-11-28 02:23:26,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-11-28 02:23:26,427 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 917 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:26,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 3350 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:23:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2024-11-28 02:23:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1777. [2024-11-28 02:23:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1465 states have (on average 1.6552901023890785) internal successors, (2425), 1767 states have internal predecessors, (2425), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:23:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2477 transitions. [2024-11-28 02:23:26,476 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2477 transitions. Word has length 94 [2024-11-28 02:23:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:26,477 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2477 transitions. [2024-11-28 02:23:26,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.416666666666666) internal successors, (113), 15 states have internal predecessors, (113), 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-28 02:23:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2477 transitions. [2024-11-28 02:23:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:23:26,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:26,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:26,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:23:26,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:26,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2054411543, now seen corresponding path program 1 times [2024-11-28 02:23:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630903789] [2024-11-28 02:23:26,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630903789] [2024-11-28 02:23:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630903789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:27,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:27,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:23:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094186154] [2024-11-28 02:23:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:27,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:23:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:27,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:23:27,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:23:27,366 INFO L87 Difference]: Start difference. First operand 1777 states and 2477 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-28 02:23:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:30,142 INFO L93 Difference]: Finished difference Result 1796 states and 2502 transitions. [2024-11-28 02:23:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:23:30,143 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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 96 [2024-11-28 02:23:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:30,148 INFO L225 Difference]: With dead ends: 1796 [2024-11-28 02:23:30,148 INFO L226 Difference]: Without dead ends: 1796 [2024-11-28 02:23:30,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:23:30,149 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 896 mSDsluCounter, 6774 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 7413 SdHoareTripleChecker+Invalid, 4451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:30,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 7413 Invalid, 4451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:23:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2024-11-28 02:23:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1792. [2024-11-28 02:23:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1479 states have (on average 1.6511156186612577) internal successors, (2442), 1780 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:23:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2496 transitions. [2024-11-28 02:23:30,181 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2496 transitions. Word has length 96 [2024-11-28 02:23:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:30,181 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2496 transitions. [2024-11-28 02:23:30,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-28 02:23:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2496 transitions. [2024-11-28 02:23:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:23:30,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:30,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:30,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:23:30,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:30,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:30,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2054411542, now seen corresponding path program 1 times [2024-11-28 02:23:30,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:30,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637405132] [2024-11-28 02:23:30,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637405132] [2024-11-28 02:23:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637405132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:23:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463121915] [2024-11-28 02:23:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:31,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:23:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:23:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:23:31,050 INFO L87 Difference]: Start difference. First operand 1792 states and 2496 transitions. Second operand has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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-28 02:23:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:33,287 INFO L93 Difference]: Finished difference Result 1795 states and 2500 transitions. [2024-11-28 02:23:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:23:33,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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 96 [2024-11-28 02:23:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:33,292 INFO L225 Difference]: With dead ends: 1795 [2024-11-28 02:23:33,293 INFO L226 Difference]: Without dead ends: 1795 [2024-11-28 02:23:33,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:23:33,293 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 912 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 4425 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:33,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 4425 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:23:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-28 02:23:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1792. [2024-11-28 02:23:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1479 states have (on average 1.649763353617309) internal successors, (2440), 1780 states have internal predecessors, (2440), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:23:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2494 transitions. [2024-11-28 02:23:33,319 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2494 transitions. Word has length 96 [2024-11-28 02:23:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:33,320 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2494 transitions. [2024-11-28 02:23:33,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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-28 02:23:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2494 transitions. [2024-11-28 02:23:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 02:23:33,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:33,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:33,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:23:33,322 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:33,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1792931878, now seen corresponding path program 1 times [2024-11-28 02:23:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:33,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454746852] [2024-11-28 02:23:33,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454746852] [2024-11-28 02:23:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454746852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839002152] [2024-11-28 02:23:34,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:34,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:23:34,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:23:34,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:23:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:34,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 02:23:34,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:23:34,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:23:34,434 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:23:34,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:23:34,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:34,510 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:34,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:23:34,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:34,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-28 02:23:34,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:23:34,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-28 02:23:34,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:23:34,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:23:34,698 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:23:34,699 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-28 02:23:34,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839002152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:34,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:23:34,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 02:23:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945014744] [2024-11-28 02:23:34,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:23:34,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:23:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:34,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:23:34,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=249, Unknown=11, NotChecked=32, Total=342 [2024-11-28 02:23:34,752 INFO L87 Difference]: Start difference. First operand 1792 states and 2494 transitions. Second operand has 16 states, 14 states have (on average 10.071428571428571) internal successors, (141), 15 states have internal predecessors, (141), 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-28 02:23:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:36,498 INFO L93 Difference]: Finished difference Result 1794 states and 2498 transitions. [2024-11-28 02:23:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:23:36,499 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 10.071428571428571) internal successors, (141), 15 states have internal predecessors, (141), 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 97 [2024-11-28 02:23:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:36,503 INFO L225 Difference]: With dead ends: 1794 [2024-11-28 02:23:36,504 INFO L226 Difference]: Without dead ends: 1794 [2024-11-28 02:23:36,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=490, Unknown=11, NotChecked=46, Total=650 [2024-11-28 02:23:36,507 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 882 mSDsluCounter, 4327 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:36,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 4966 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2950 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:23:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2024-11-28 02:23:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1791. [2024-11-28 02:23:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1479 states have (on average 1.6484110885733603) internal successors, (2438), 1779 states have internal predecessors, (2438), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:23:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2492 transitions. [2024-11-28 02:23:36,535 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2492 transitions. Word has length 97 [2024-11-28 02:23:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:36,536 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2492 transitions. [2024-11-28 02:23:36,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 10.071428571428571) internal successors, (141), 15 states have internal predecessors, (141), 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-28 02:23:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2492 transitions. [2024-11-28 02:23:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 02:23:36,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:36,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:36,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:23:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:36,741 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:36,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1792931879, now seen corresponding path program 1 times [2024-11-28 02:23:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:36,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107208788] [2024-11-28 02:23:36,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:36,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107208788] [2024-11-28 02:23:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107208788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573425812] [2024-11-28 02:23:37,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:23:37,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:23:37,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:23:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:37,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:23:37,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:23:38,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:23:38,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:23:38,149 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:23:38,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:23:38,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:38,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:23:38,313 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-28 02:23:38,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:23:38,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:38,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 62 treesize of output 57 [2024-11-28 02:23:38,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:23:38,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:38,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 62 treesize of output 57 [2024-11-28 02:23:38,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:23:38,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:23:38,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:23:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:38,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:23:38,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1168 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:23:38,750 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1168 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-28 02:23:38,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1175) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1174))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1175) .cse1 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 02:23:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573425812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:38,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:23:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 02:23:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977387306] [2024-11-28 02:23:38,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:23:38,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:23:38,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:38,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:23:38,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2024-11-28 02:23:38,817 INFO L87 Difference]: Start difference. First operand 1791 states and 2492 transitions. Second operand has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 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-28 02:23:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:42,456 INFO L93 Difference]: Finished difference Result 1793 states and 2496 transitions. [2024-11-28 02:23:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:23:42,457 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 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 97 [2024-11-28 02:23:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:42,463 INFO L225 Difference]: With dead ends: 1793 [2024-11-28 02:23:42,463 INFO L226 Difference]: Without dead ends: 1793 [2024-11-28 02:23:42,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2024-11-28 02:23:42,464 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 884 mSDsluCounter, 5771 mSDsCounter, 0 mSdLazyCounter, 5428 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 6412 SdHoareTripleChecker+Invalid, 5450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:42,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 6412 Invalid, 5450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5428 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-28 02:23:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-11-28 02:23:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1775. [2024-11-28 02:23:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1465 states have (on average 1.6525597269624572) internal successors, (2421), 1765 states have internal predecessors, (2421), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:23:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2473 transitions. [2024-11-28 02:23:42,490 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2473 transitions. Word has length 97 [2024-11-28 02:23:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:42,490 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2473 transitions. [2024-11-28 02:23:42,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 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-28 02:23:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2473 transitions. [2024-11-28 02:23:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:23:42,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:42,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:42,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:23:42,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:42,693 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:42,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash 310343916, now seen corresponding path program 1 times [2024-11-28 02:23:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174052439] [2024-11-28 02:23:42,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:42,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:43,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:43,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174052439] [2024-11-28 02:23:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174052439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:43,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:23:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203960584] [2024-11-28 02:23:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:43,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:23:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:43,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:23:43,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:23:43,381 INFO L87 Difference]: Start difference. First operand 1775 states and 2473 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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-28 02:23:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:45,718 INFO L93 Difference]: Finished difference Result 1800 states and 2504 transitions. [2024-11-28 02:23:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:23:45,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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 99 [2024-11-28 02:23:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:45,722 INFO L225 Difference]: With dead ends: 1800 [2024-11-28 02:23:45,722 INFO L226 Difference]: Without dead ends: 1800 [2024-11-28 02:23:45,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:23:45,724 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 899 mSDsluCounter, 6150 mSDsCounter, 0 mSdLazyCounter, 4055 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 6788 SdHoareTripleChecker+Invalid, 4073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:45,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 6788 Invalid, 4073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4055 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 02:23:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2024-11-28 02:23:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1796. [2024-11-28 02:23:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1485 states have (on average 1.6457912457912458) internal successors, (2444), 1784 states have internal predecessors, (2444), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:23:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2498 transitions. [2024-11-28 02:23:45,747 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2498 transitions. Word has length 99 [2024-11-28 02:23:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:45,747 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2498 transitions. [2024-11-28 02:23:45,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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-28 02:23:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2498 transitions. [2024-11-28 02:23:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:23:45,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:45,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:45,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:23:45,749 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:45,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash 310343917, now seen corresponding path program 1 times [2024-11-28 02:23:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:45,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072843186] [2024-11-28 02:23:45,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072843186] [2024-11-28 02:23:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072843186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:23:46,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:23:46,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:23:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487053692] [2024-11-28 02:23:46,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:23:46,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:23:46,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:46,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:23:46,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:23:46,643 INFO L87 Difference]: Start difference. First operand 1796 states and 2498 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-28 02:23:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:48,857 INFO L93 Difference]: Finished difference Result 1799 states and 2502 transitions. [2024-11-28 02:23:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:23:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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 99 [2024-11-28 02:23:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:48,861 INFO L225 Difference]: With dead ends: 1799 [2024-11-28 02:23:48,862 INFO L226 Difference]: Without dead ends: 1799 [2024-11-28 02:23:48,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:23:48,862 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 913 mSDsluCounter, 3784 mSDsCounter, 0 mSdLazyCounter, 3415 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 3432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:48,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 4426 Invalid, 3432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3415 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:23:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-11-28 02:23:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1796. [2024-11-28 02:23:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1485 states have (on average 1.6444444444444444) internal successors, (2442), 1784 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:23:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2496 transitions. [2024-11-28 02:23:48,885 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2496 transitions. Word has length 99 [2024-11-28 02:23:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:48,886 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2496 transitions. [2024-11-28 02:23:48,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-28 02:23:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2496 transitions. [2024-11-28 02:23:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:23:48,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:48,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:48,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:23:48,887 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:48,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1020937871, now seen corresponding path program 1 times [2024-11-28 02:23:48,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:48,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798687970] [2024-11-28 02:23:48,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:48,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798687970] [2024-11-28 02:23:49,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798687970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13412786] [2024-11-28 02:23:49,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:23:49,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:23:49,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:23:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:49,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 02:23:49,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:23:49,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:23:50,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:23:50,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:23:50,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:50,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:50,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:23:50,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:50,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 42 treesize of output 41 [2024-11-28 02:23:50,212 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:50,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:23:50,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:23:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:50,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:23:50,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:23:50,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:23:50,275 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:23:50,276 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-28 02:23:50,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1480))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 02:23:50,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1480))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse2)))) is different from false [2024-11-28 02:23:50,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1484)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1480))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2024-11-28 02:23:50,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13412786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:50,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:23:50,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 18 [2024-11-28 02:23:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174785731] [2024-11-28 02:23:50,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:23:50,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:23:50,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:50,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:23:50,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=293, Unknown=5, NotChecked=190, Total=552 [2024-11-28 02:23:50,325 INFO L87 Difference]: Start difference. First operand 1796 states and 2496 transitions. Second operand has 19 states, 17 states have (on average 8.941176470588236) internal successors, (152), 19 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:23:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:23:53,080 INFO L93 Difference]: Finished difference Result 1798 states and 2500 transitions. [2024-11-28 02:23:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:23:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.941176470588236) internal successors, (152), 19 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-28 02:23:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:23:53,084 INFO L225 Difference]: With dead ends: 1798 [2024-11-28 02:23:53,084 INFO L226 Difference]: Without dead ends: 1798 [2024-11-28 02:23:53,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=593, Unknown=5, NotChecked=270, Total=992 [2024-11-28 02:23:53,085 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 880 mSDsluCounter, 7999 mSDsCounter, 0 mSdLazyCounter, 5123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 8637 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:23:53,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 8637 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5123 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:23:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-11-28 02:23:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1795. [2024-11-28 02:23:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1485 states have (on average 1.6430976430976432) internal successors, (2440), 1783 states have internal predecessors, (2440), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:23:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2494 transitions. [2024-11-28 02:23:53,108 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2494 transitions. Word has length 100 [2024-11-28 02:23:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:23:53,108 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2494 transitions. [2024-11-28 02:23:53,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.941176470588236) internal successors, (152), 19 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:23:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2494 transitions. [2024-11-28 02:23:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:23:53,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:23:53,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:23:53,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:23:53,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:53,310 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:23:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:23:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1020937872, now seen corresponding path program 1 times [2024-11-28 02:23:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:23:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122698472] [2024-11-28 02:23:53,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:23:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:23:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122698472] [2024-11-28 02:23:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122698472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092321597] [2024-11-28 02:23:54,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:23:54,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:23:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:23:54,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:23:54,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:23:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:54,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 02:23:54,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:23:54,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:23:54,851 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:23:54,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:23:54,857 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-28 02:23:54,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:54,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:54,978 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-28 02:23:54,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:23:55,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:55,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:23:55,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:23:55,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:55,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:23:55,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:23:55,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:55,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:23:55,295 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-28 02:23:55,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:23:55,351 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-28 02:23:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:23:55,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:23:55,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1649 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1649))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1650))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1651) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1649 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1649))) (or (forall ((v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (<= 0 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1650) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) is different from false [2024-11-28 02:23:55,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1649 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_1649))) (or (forall ((v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_1650))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store .cse0 .cse1 v_ArrVal_1652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1651) |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_1649 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_1649))) (or (forall ((v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_1650) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0))))))) is different from false [2024-11-28 02:23:55,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1657))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1658) .cse5 v_ArrVal_1649))) (or (forall ((v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1650))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1651) |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_1658 (Array Int Int)) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1657))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1658) .cse8 v_ArrVal_1649))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1650) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))))))) is different from false [2024-11-28 02:23:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092321597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:55,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:23:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-28 02:23:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958534868] [2024-11-28 02:23:55,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:23:55,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:23:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:55,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:23:55,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=611, Unknown=3, NotChecked=156, Total=870 [2024-11-28 02:23:55,789 INFO L87 Difference]: Start difference. First operand 1795 states and 2494 transitions. Second operand has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 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-28 02:24:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:00,653 INFO L93 Difference]: Finished difference Result 1797 states and 2498 transitions. [2024-11-28 02:24:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:24:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 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 100 [2024-11-28 02:24:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:00,658 INFO L225 Difference]: With dead ends: 1797 [2024-11-28 02:24:00,658 INFO L226 Difference]: Without dead ends: 1797 [2024-11-28 02:24:00,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=901, Unknown=3, NotChecked=192, Total=1260 [2024-11-28 02:24:00,659 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 884 mSDsluCounter, 7094 mSDsCounter, 0 mSdLazyCounter, 7030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 7734 SdHoareTripleChecker+Invalid, 7062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:00,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 7734 Invalid, 7062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 7030 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-28 02:24:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-11-28 02:24:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1773. [2024-11-28 02:24:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1465 states have (on average 1.6498293515358362) internal successors, (2417), 1763 states have internal predecessors, (2417), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:24:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2469 transitions. [2024-11-28 02:24:00,682 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2469 transitions. Word has length 100 [2024-11-28 02:24:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:00,682 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2469 transitions. [2024-11-28 02:24:00,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 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-28 02:24:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2469 transitions. [2024-11-28 02:24:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:24:00,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:00,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:00,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:24:00,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:24:00,885 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:00,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1608326352, now seen corresponding path program 1 times [2024-11-28 02:24:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:00,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970448414] [2024-11-28 02:24:00,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970448414] [2024-11-28 02:24:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970448414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:24:01,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:24:01,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:24:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315107992] [2024-11-28 02:24:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:24:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:24:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:01,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:24:01,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:24:01,478 INFO L87 Difference]: Start difference. First operand 1773 states and 2469 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:24:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:03,482 INFO L93 Difference]: Finished difference Result 1804 states and 2506 transitions. [2024-11-28 02:24:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:24:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 02:24:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:03,487 INFO L225 Difference]: With dead ends: 1804 [2024-11-28 02:24:03,487 INFO L226 Difference]: Without dead ends: 1804 [2024-11-28 02:24:03,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:24:03,487 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 901 mSDsluCounter, 5552 mSDsCounter, 0 mSdLazyCounter, 3654 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:03,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 6192 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3654 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:24:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-28 02:24:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1800. [2024-11-28 02:24:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1491 states have (on average 1.6405097250167673) internal successors, (2446), 1788 states have internal predecessors, (2446), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:24:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2500 transitions. [2024-11-28 02:24:03,511 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2500 transitions. Word has length 102 [2024-11-28 02:24:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:03,511 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2500 transitions. [2024-11-28 02:24:03,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:24:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2500 transitions. [2024-11-28 02:24:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:24:03,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:03,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:24:03,513 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:03,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1608326351, now seen corresponding path program 1 times [2024-11-28 02:24:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:03,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648999955] [2024-11-28 02:24:03,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648999955] [2024-11-28 02:24:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648999955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:24:04,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:24:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:24:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460868298] [2024-11-28 02:24:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:24:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:24:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:04,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:24:04,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:24:04,549 INFO L87 Difference]: Start difference. First operand 1800 states and 2500 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:24:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:06,847 INFO L93 Difference]: Finished difference Result 1803 states and 2504 transitions. [2024-11-28 02:24:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:24:06,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 02:24:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:06,850 INFO L225 Difference]: With dead ends: 1803 [2024-11-28 02:24:06,850 INFO L226 Difference]: Without dead ends: 1803 [2024-11-28 02:24:06,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:24:06,850 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 914 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 3584 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 4330 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:06,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 4330 Invalid, 3601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3584 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:24:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-28 02:24:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1800. [2024-11-28 02:24:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1491 states have (on average 1.6391683433936954) internal successors, (2444), 1788 states have internal predecessors, (2444), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:24:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2498 transitions. [2024-11-28 02:24:06,868 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2498 transitions. Word has length 102 [2024-11-28 02:24:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:06,869 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2498 transitions. [2024-11-28 02:24:06,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:24:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2498 transitions. [2024-11-28 02:24:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:24:06,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:06,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:06,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:24:06,870 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2097352365, now seen corresponding path program 1 times [2024-11-28 02:24:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065214875] [2024-11-28 02:24:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:07,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065214875] [2024-11-28 02:24:07,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065214875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671207457] [2024-11-28 02:24:07,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:07,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:24:07,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:24:07,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:24:07,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:24:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:07,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 02:24:07,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:24:07,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:24:08,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:24:08,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:24:08,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:24:08,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:08,148 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-28 02:24:08,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:08,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 42 treesize of output 41 [2024-11-28 02:24:08,250 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:08,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 42 treesize of output 41 [2024-11-28 02:24:08,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:08,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:24:08,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:24:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:08,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:24:08,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1989) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:24:08,330 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-28 02:24:08,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (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$#0.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1988))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1989)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:24:08,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1988))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1989)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:24:08,373 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 02:24:08,374 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-28 02:24:08,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1987))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1988)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1989)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem56#1.base|)) is different from false [2024-11-28 02:24:08,390 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1987))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1988)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1989)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:24:08,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1992)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1987))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1988)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1989)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:24:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671207457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:08,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:24:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 20 [2024-11-28 02:24:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750239859] [2024-11-28 02:24:08,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:24:08,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:24:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:08,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:24:08,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=362, Unknown=7, NotChecked=308, Total=756 [2024-11-28 02:24:08,424 INFO L87 Difference]: Start difference. First operand 1800 states and 2498 transitions. Second operand has 21 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:24:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:10,352 INFO L93 Difference]: Finished difference Result 1802 states and 2502 transitions. [2024-11-28 02:24:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:24:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-28 02:24:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:10,355 INFO L225 Difference]: With dead ends: 1802 [2024-11-28 02:24:10,355 INFO L226 Difference]: Without dead ends: 1802 [2024-11-28 02:24:10,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=742, Unknown=7, NotChecked=434, Total=1332 [2024-11-28 02:24:10,356 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 882 mSDsluCounter, 4946 mSDsCounter, 0 mSdLazyCounter, 3315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 5583 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:10,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 5583 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3315 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:24:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-28 02:24:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1799. [2024-11-28 02:24:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1491 states have (on average 1.6378269617706238) internal successors, (2442), 1787 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:24:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2496 transitions. [2024-11-28 02:24:10,389 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2496 transitions. Word has length 103 [2024-11-28 02:24:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:10,389 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2496 transitions. [2024-11-28 02:24:10,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:24:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2496 transitions. [2024-11-28 02:24:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:24:10,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:10,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:10,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 02:24:10,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:24:10,592 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:10,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2097352366, now seen corresponding path program 1 times [2024-11-28 02:24:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:10,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977958377] [2024-11-28 02:24:10,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:11,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977958377] [2024-11-28 02:24:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977958377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338836698] [2024-11-28 02:24:11,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:11,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:24:11,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:24:11,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:24:11,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:24:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:11,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 02:24:11,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:24:11,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:24:12,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:24:12,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:24:12,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:24:12,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:24:12,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:12,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-28 02:24:12,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-28 02:24:12,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:12,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:24:12,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-28 02:24:12,452 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:12,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:24:12,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:24:12,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:12,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:24:12,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:24:12,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:24:12,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:24:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:12,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:24:12,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2174 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:24:12,649 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2174 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:24:12,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2171) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2172))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2171) .cse1 v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 02:24:12,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2170))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2172))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2169) .cse0 v_ArrVal_2171) .cse1 v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2170))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2169) .cse5 v_ArrVal_2171) (select (select (store .cse6 .cse5 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:24:12,842 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2170))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2169) .cse1 v_ArrVal_2171) (select (select (store .cse2 .cse1 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2170))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2172))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2169) .cse4 v_ArrVal_2171) .cse5 v_ArrVal_2174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-28 02:24:12,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:24:12,929 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 300 treesize of output 304 [2024-11-28 02:24:13,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2180))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2170))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2179) .cse0 v_ArrVal_2169) .cse1 v_ArrVal_2171) (select (select (store .cse2 .cse1 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2174))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_14 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_16))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_prenex_15))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_18) .cse5 v_prenex_17) .cse6 v_prenex_14) (select (select (store .cse7 .cse6 v_prenex_20) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_19))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 21 |c_ULTIMATE.start_main_#t~mem54#1.offset|))) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_prenex_15 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_16))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_15)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_20)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2173)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~mem54#1.base|)))) is different from false [2024-11-28 02:24:13,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338836698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:13,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:24:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2024-11-28 02:24:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549790520] [2024-11-28 02:24:13,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:24:13,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:24:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:13,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:24:13,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=550, Unknown=13, NotChecked=318, Total=992 [2024-11-28 02:24:13,079 INFO L87 Difference]: Start difference. First operand 1799 states and 2496 transitions. Second operand has 23 states, 20 states have (on average 8.1) internal successors, (162), 23 states have internal predecessors, (162), 2 states have call successors, (2), 1 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-28 02:24:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:16,630 INFO L93 Difference]: Finished difference Result 1801 states and 2500 transitions. [2024-11-28 02:24:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:24:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.1) internal successors, (162), 23 states have internal predecessors, (162), 2 states have call successors, (2), 1 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 103 [2024-11-28 02:24:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:16,632 INFO L225 Difference]: With dead ends: 1801 [2024-11-28 02:24:16,633 INFO L226 Difference]: Without dead ends: 1801 [2024-11-28 02:24:16,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=888, Unknown=13, NotChecked=402, Total=1482 [2024-11-28 02:24:16,633 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 878 mSDsluCounter, 6020 mSDsCounter, 0 mSdLazyCounter, 5177 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 6656 SdHoareTripleChecker+Invalid, 5207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:16,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 6656 Invalid, 5207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5177 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-28 02:24:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-28 02:24:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1771. [2024-11-28 02:24:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1465 states have (on average 1.647098976109215) internal successors, (2413), 1761 states have internal predecessors, (2413), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:24:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2465 transitions. [2024-11-28 02:24:16,657 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2465 transitions. Word has length 103 [2024-11-28 02:24:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:16,658 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2465 transitions. [2024-11-28 02:24:16,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.1) internal successors, (162), 23 states have internal predecessors, (162), 2 states have call successors, (2), 1 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-28 02:24:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2465 transitions. [2024-11-28 02:24:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:24:16,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:16,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:16,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 02:24:16,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 02:24:16,861 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:16,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1104770930, now seen corresponding path program 1 times [2024-11-28 02:24:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:16,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589503755] [2024-11-28 02:24:16,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589503755] [2024-11-28 02:24:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589503755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:24:17,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:24:17,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:24:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508394414] [2024-11-28 02:24:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:24:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:24:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:17,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:24:17,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:24:17,703 INFO L87 Difference]: Start difference. First operand 1771 states and 2465 transitions. Second operand has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 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-28 02:24:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:19,744 INFO L93 Difference]: Finished difference Result 1810 states and 2510 transitions. [2024-11-28 02:24:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:24:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 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 106 [2024-11-28 02:24:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:19,747 INFO L225 Difference]: With dead ends: 1810 [2024-11-28 02:24:19,747 INFO L226 Difference]: Without dead ends: 1810 [2024-11-28 02:24:19,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:24:19,749 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 919 mSDsluCounter, 4879 mSDsCounter, 0 mSdLazyCounter, 3296 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 5518 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:19,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 5518 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3296 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:24:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-28 02:24:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1806. [2024-11-28 02:24:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1499 states have (on average 1.6344229486324215) internal successors, (2450), 1794 states have internal predecessors, (2450), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:24:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2504 transitions. [2024-11-28 02:24:19,772 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2504 transitions. Word has length 106 [2024-11-28 02:24:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:19,772 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2504 transitions. [2024-11-28 02:24:19,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 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-28 02:24:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2504 transitions. [2024-11-28 02:24:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:24:19,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:19,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:19,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:24:19,774 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:19,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1104770931, now seen corresponding path program 1 times [2024-11-28 02:24:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557399853] [2024-11-28 02:24:19,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557399853] [2024-11-28 02:24:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557399853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:24:20,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:24:20,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:24:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810968489] [2024-11-28 02:24:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:24:20,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:24:20,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:20,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:24:20,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:24:20,981 INFO L87 Difference]: Start difference. First operand 1806 states and 2504 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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-28 02:24:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:24,094 INFO L93 Difference]: Finished difference Result 1809 states and 2508 transitions. [2024-11-28 02:24:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:24:24,095 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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 106 [2024-11-28 02:24:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:24,098 INFO L225 Difference]: With dead ends: 1809 [2024-11-28 02:24:24,098 INFO L226 Difference]: Without dead ends: 1809 [2024-11-28 02:24:24,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:24:24,099 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 901 mSDsluCounter, 4153 mSDsCounter, 0 mSdLazyCounter, 4125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 4790 SdHoareTripleChecker+Invalid, 4149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:24,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 4790 Invalid, 4149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4125 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-28 02:24:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-28 02:24:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1806. [2024-11-28 02:24:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1499 states have (on average 1.6330887258172115) internal successors, (2448), 1794 states have internal predecessors, (2448), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:24:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2502 transitions. [2024-11-28 02:24:24,132 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2502 transitions. Word has length 106 [2024-11-28 02:24:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:24,132 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2502 transitions. [2024-11-28 02:24:24,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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-28 02:24:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2502 transitions. [2024-11-28 02:24:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 02:24:24,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:24,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:24,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:24:24,134 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:24,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 328047727, now seen corresponding path program 1 times [2024-11-28 02:24:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624771644] [2024-11-28 02:24:24,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:25,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624771644] [2024-11-28 02:24:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624771644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114031713] [2024-11-28 02:24:25,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:25,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:24:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:24:25,079 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:24:25,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:24:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:25,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 02:24:25,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:24:25,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:24:25,542 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:24:25,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:24:25,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:24:25,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 22 treesize of output 10 [2024-11-28 02:24:25,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:25,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:24:25,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:25,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:24:26,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:26,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:24:26,084 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:26,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:24:26,151 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:26,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:24:26,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:24:26,257 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-28 02:24:26,257 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 17 treesize of output 22 [2024-11-28 02:24:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:26,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:24:26,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2544 (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$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2544))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:24:26,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2544 (Array Int Int)) (v_ArrVal_2543 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2543))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2544)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:24:26,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2544 (Array Int Int)) (v_ArrVal_2543 (Array Int Int)) (v_ArrVal_2542 (Array Int Int))) (= (select |c_#valid| (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$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2549))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2542)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2543)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2544)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:24:26,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114031713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:26,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:24:26,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-28 02:24:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193548895] [2024-11-28 02:24:26,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:24:26,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:24:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:26,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:24:26,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=751, Unknown=99, NotChecked=186, Total=1190 [2024-11-28 02:24:26,802 INFO L87 Difference]: Start difference. First operand 1806 states and 2502 transitions. Second operand has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 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-28 02:24:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:28,694 INFO L93 Difference]: Finished difference Result 1808 states and 2506 transitions. [2024-11-28 02:24:28,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:24:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 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 107 [2024-11-28 02:24:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:28,696 INFO L225 Difference]: With dead ends: 1808 [2024-11-28 02:24:28,696 INFO L226 Difference]: Without dead ends: 1808 [2024-11-28 02:24:28,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=803, Unknown=100, NotChecked=192, Total=1260 [2024-11-28 02:24:28,697 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 864 mSDsluCounter, 4307 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 4945 SdHoareTripleChecker+Invalid, 3052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:28,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 4945 Invalid, 3052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:24:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-28 02:24:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1805. [2024-11-28 02:24:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1499 states have (on average 1.6317545030020013) internal successors, (2446), 1793 states have internal predecessors, (2446), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:24:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2500 transitions. [2024-11-28 02:24:28,723 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2500 transitions. Word has length 107 [2024-11-28 02:24:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:28,724 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2500 transitions. [2024-11-28 02:24:28,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 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-28 02:24:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2500 transitions. [2024-11-28 02:24:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 02:24:28,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:28,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:28,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:24:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 02:24:28,926 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash 328047728, now seen corresponding path program 1 times [2024-11-28 02:24:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197382247] [2024-11-28 02:24:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197382247] [2024-11-28 02:24:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197382247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819476417] [2024-11-28 02:24:30,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:30,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:24:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:24:30,140 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:24:30,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:24:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:30,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 02:24:30,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:24:30,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:24:30,604 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:24:30,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:24:30,609 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-28 02:24:30,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:24:30,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:24:30,727 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-28 02:24:30,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:24:30,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:30,898 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-28 02:24:30,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:24:31,051 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:31,051 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-28 02:24:31,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:24:31,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:31,155 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-28 02:24:31,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:24:31,259 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:31,260 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-28 02:24:31,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:24:31,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:24:31,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:24:31,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:24:31,446 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-28 02:24:31,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:24:31,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:24:31,515 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 02:24:31,516 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-28 02:24:31,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:24:31,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:24:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:31,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:24:32,499 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2745))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2744) .cse1 v_ArrVal_2747) (select (select (store .cse2 .cse1 v_ArrVal_2746) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2748))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2749 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2750 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2745))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2746))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2744) .cse4 v_ArrVal_2747) .cse5 v_ArrVal_2748) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2750) (select (select (store .cse6 .cse5 v_ArrVal_2749) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-28 02:24:32,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int)) (v_ArrVal_2742 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2743))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2745))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2742) .cse0 v_ArrVal_2744) .cse1 v_ArrVal_2747) (select (select (store .cse2 .cse1 v_ArrVal_2746) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2748))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2749 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2750 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2743))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2745))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2746))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2742) .cse5 v_ArrVal_2744) .cse6 v_ArrVal_2747) .cse7 v_ArrVal_2748) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2750) (select (select (store .cse8 .cse7 v_ArrVal_2749) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 02:24:34,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:24:34,122 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-28 02:24:35,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_2750 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (or (= v_prenex_33 |c_ULTIMATE.start_main_#t~mem54#1.base|) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_27))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_31))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_28))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_26))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_29) .cse0 v_prenex_32) .cse1 v_prenex_30) .cse2 v_prenex_25) .cse3 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_33 v_ArrVal_2750) (select (select (store .cse5 .cse3 v_ArrVal_2749) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2756 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int)) (v_ArrVal_2742 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2756))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2743))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2745))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2755) .cse9 v_ArrVal_2742) .cse10 v_ArrVal_2744) .cse11 v_ArrVal_2747) (select (select (store .cse12 .cse11 v_ArrVal_2746) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2748))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_33 Int) (v_prenex_30 (Array Int Int)) (v_ArrVal_2750 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (or (= v_prenex_33 |c_ULTIMATE.start_main_#t~mem54#1.base|) (let ((.cse22 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_27))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse21 (store .cse22 .cse15 v_prenex_31))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse16 v_prenex_28))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse19 (store .cse20 .cse17 v_prenex_26))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_29) .cse15 v_prenex_32) .cse16 v_prenex_30) .cse17 v_prenex_25) .cse18 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_33 v_ArrVal_2750) (select (select (store .cse19 .cse18 v_ArrVal_2749) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-28 02:24:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819476417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:24:35,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:24:35,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-28 02:24:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720935795] [2024-11-28 02:24:35,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:24:35,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 02:24:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:35,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 02:24:35,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1419, Unknown=47, NotChecked=240, Total=1892 [2024-11-28 02:24:35,038 INFO L87 Difference]: Start difference. First operand 1805 states and 2500 transitions. Second operand has 32 states, 29 states have (on average 6.0) internal successors, (174), 30 states have internal predecessors, (174), 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-28 02:24:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:47,910 INFO L93 Difference]: Finished difference Result 1807 states and 2504 transitions. [2024-11-28 02:24:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:24:47,910 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.0) internal successors, (174), 30 states have internal predecessors, (174), 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 107 [2024-11-28 02:24:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:47,913 INFO L225 Difference]: With dead ends: 1807 [2024-11-28 02:24:47,913 INFO L226 Difference]: Without dead ends: 1807 [2024-11-28 02:24:47,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=321, Invalid=2194, Unknown=47, NotChecked=300, Total=2862 [2024-11-28 02:24:47,914 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 878 mSDsluCounter, 7294 mSDsCounter, 0 mSdLazyCounter, 6852 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 7929 SdHoareTripleChecker+Invalid, 6876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:47,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 7929 Invalid, 6876 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6852 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-28 02:24:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-28 02:24:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1769. [2024-11-28 02:24:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1465 states have (on average 1.644368600682594) internal successors, (2409), 1759 states have internal predecessors, (2409), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:24:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2461 transitions. [2024-11-28 02:24:47,935 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2461 transitions. Word has length 107 [2024-11-28 02:24:47,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:47,935 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2461 transitions. [2024-11-28 02:24:47,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.0) internal successors, (174), 30 states have internal predecessors, (174), 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-28 02:24:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2461 transitions. [2024-11-28 02:24:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:24:47,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:47,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:47,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:24:48,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 02:24:48,137 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:48,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash -102938343, now seen corresponding path program 1 times [2024-11-28 02:24:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94267894] [2024-11-28 02:24:48,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:48,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:48,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94267894] [2024-11-28 02:24:48,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94267894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:24:48,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:24:48,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:24:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422994536] [2024-11-28 02:24:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:24:48,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:24:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:48,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:24:48,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:24:48,673 INFO L87 Difference]: Start difference. First operand 1769 states and 2461 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:24:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:24:51,036 INFO L93 Difference]: Finished difference Result 1768 states and 2459 transitions. [2024-11-28 02:24:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:24:51,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 02:24:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:24:51,039 INFO L225 Difference]: With dead ends: 1768 [2024-11-28 02:24:51,039 INFO L226 Difference]: Without dead ends: 1768 [2024-11-28 02:24:51,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:24:51,039 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 2 mSDsluCounter, 3602 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4575 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:24:51,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4575 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 02:24:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-28 02:24:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1768. [2024-11-28 02:24:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1465 states have (on average 1.6430034129692832) internal successors, (2407), 1758 states have internal predecessors, (2407), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:24:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2459 transitions. [2024-11-28 02:24:51,061 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2459 transitions. Word has length 109 [2024-11-28 02:24:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:24:51,061 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2459 transitions. [2024-11-28 02:24:51,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:24:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2459 transitions. [2024-11-28 02:24:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:24:51,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:24:51,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:24:51,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 02:24:51,062 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:24:51,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:24:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash -102938342, now seen corresponding path program 1 times [2024-11-28 02:24:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:24:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433024846] [2024-11-28 02:24:51,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:24:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:24:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:24:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:24:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:24:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433024846] [2024-11-28 02:24:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433024846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:24:53,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:24:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:24:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387545738] [2024-11-28 02:24:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:24:53,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:24:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:24:53,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:24:53,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:24:53,471 INFO L87 Difference]: Start difference. First operand 1768 states and 2459 transitions. Second operand has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:25:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:00,654 INFO L93 Difference]: Finished difference Result 1812 states and 2508 transitions. [2024-11-28 02:25:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:25:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 02:25:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:00,656 INFO L225 Difference]: With dead ends: 1812 [2024-11-28 02:25:00,657 INFO L226 Difference]: Without dead ends: 1812 [2024-11-28 02:25:00,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-11-28 02:25:00,657 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 921 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 3923 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 4931 SdHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:00,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 4931 Invalid, 3948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3923 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-28 02:25:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-28 02:25:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1809. [2024-11-28 02:25:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1505 states have (on average 1.626578073089701) internal successors, (2448), 1797 states have internal predecessors, (2448), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:25:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2502 transitions. [2024-11-28 02:25:00,675 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2502 transitions. Word has length 109 [2024-11-28 02:25:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:00,675 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2502 transitions. [2024-11-28 02:25:00,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:25:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2502 transitions. [2024-11-28 02:25:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 02:25:00,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:00,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 02:25:00,676 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:25:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1819911933, now seen corresponding path program 1 times [2024-11-28 02:25:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975360544] [2024-11-28 02:25:00,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:25:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975360544] [2024-11-28 02:25:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975360544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:25:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789233677] [2024-11-28 02:25:02,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:02,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:25:02,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:25:02,740 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:25:02,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:25:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:03,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 02:25:03,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:25:03,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:25:03,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:25:03,430 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:25:03,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:25:03,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:25:03,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:25:03,554 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-28 02:25:03,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:25:03,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:25:03,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:25:03,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:25:03,936 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:25:03,936 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-28 02:25:03,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:25:04,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:25:04,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 73 treesize of output 66 [2024-11-28 02:25:04,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:25:04,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:25:04,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 73 treesize of output 66 [2024-11-28 02:25:04,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:25:04,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:25:04,485 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-28 02:25:04,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:25:04,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:25:04,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:25:04,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:25:04,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:25:04,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:25:04,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:25:04,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:25:04,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:25:04,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:25:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:25:04,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:25:04,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3154) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3154 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3154) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:25:05,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3154 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3152) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3154) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3152 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (or (forall ((v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3153 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3151))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3152) .cse1 v_ArrVal_3154) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3153) (select (select (store .cse2 .cse1 v_ArrVal_3155) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 02:25:21,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:25:21,637 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-28 02:25:22,110 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~malloc61#1.base_9| Int)) (or (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (v_ArrVal_3153 Int) (v_ArrVal_3150 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3146))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3148))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3150))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_3151))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3145) .cse0 v_ArrVal_3147) .cse1 v_ArrVal_3149) .cse2 v_ArrVal_3152) .cse3 v_ArrVal_3154) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3153) (select (select (store .cse5 .cse3 v_ArrVal_3155) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_9| |c_ULTIMATE.start_main_#t~mem56#1.base|))) (forall ((v_prenex_50 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_53 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_51 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_55 (Array Int Int)) (v_prenex_48 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_51))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_53))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_55))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_50) .cse9 v_prenex_52) .cse10 v_prenex_54) .cse11 v_prenex_47) (select (select (store .cse12 .cse11 v_prenex_46) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_48))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-28 02:25:26,341 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_prenex_50 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_53 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_51 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_55 (Array Int Int)) (v_prenex_48 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_prenex_51))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_prenex_53))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_prenex_55))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_50) .cse1 v_prenex_52) .cse2 v_prenex_54) .cse3 v_prenex_47) (select (select (store .cse4 .cse3 v_prenex_46) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_48))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_9| .cse0) (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (v_ArrVal_3153 Int) (v_ArrVal_3150 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3146))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3148))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3150))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3151))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ 43 (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3145) .cse8 v_ArrVal_3147) .cse9 v_ArrVal_3149) .cse10 v_ArrVal_3152) .cse11 v_ArrVal_3154) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3153) (select (select (store .cse12 .cse11 v_ArrVal_3155) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-28 02:25:30,940 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3160 (Array Int Int)) (v_ArrVal_3161 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3161))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (v_ArrVal_3153 Int) (v_ArrVal_3150 (Array Int Int))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3146))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3148))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3150))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3151))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3160) .cse0 v_ArrVal_3145) .cse1 v_ArrVal_3147) .cse2 v_ArrVal_3149) .cse3 v_ArrVal_3152) .cse4 v_ArrVal_3154) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3153) (select (select (store .cse6 .cse4 v_ArrVal_3155) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_9| .cse0))))) (forall ((v_prenex_50 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_53 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_51 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_55 (Array Int Int)) (v_ArrVal_3160 (Array Int Int)) (v_ArrVal_3161 (Array Int Int)) (v_prenex_48 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3161))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_51))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_53))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_55))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3160) .cse11 v_prenex_50) .cse12 v_prenex_52) .cse13 v_prenex_54) .cse14 v_prenex_47) (select (select (store .cse15 .cse14 v_prenex_46) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_48))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-11-28 02:25:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789233677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:25:30,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:25:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 25 [2024-11-28 02:25:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827993680] [2024-11-28 02:25:30,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:25:30,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:25:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:30,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:25:30,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=987, Unknown=47, NotChecked=350, Total=1560 [2024-11-28 02:25:30,996 INFO L87 Difference]: Start difference. First operand 1809 states and 2502 transitions. Second operand has 26 states, 24 states have (on average 6.958333333333333) internal successors, (167), 25 states have internal predecessors, (167), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:26:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:16,842 INFO L93 Difference]: Finished difference Result 1811 states and 2506 transitions. [2024-11-28 02:26:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:26:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.958333333333333) internal successors, (167), 25 states have internal predecessors, (167), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2024-11-28 02:26:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:16,846 INFO L225 Difference]: With dead ends: 1811 [2024-11-28 02:26:16,846 INFO L226 Difference]: Without dead ends: 1811 [2024-11-28 02:26:16,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=326, Invalid=1903, Unknown=47, NotChecked=480, Total=2756 [2024-11-28 02:26:16,852 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 873 mSDsluCounter, 6831 mSDsCounter, 0 mSdLazyCounter, 6294 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 7465 SdHoareTripleChecker+Invalid, 6317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:16,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 7465 Invalid, 6317 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6294 Invalid, 0 Unknown, 0 Unchecked, 42.9s Time] [2024-11-28 02:26:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-28 02:26:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1767. [2024-11-28 02:26:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1465 states have (on average 1.6416382252559727) internal successors, (2405), 1757 states have internal predecessors, (2405), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:26:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2457 transitions. [2024-11-28 02:26:16,879 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2457 transitions. Word has length 110 [2024-11-28 02:26:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:16,879 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2457 transitions. [2024-11-28 02:26:16,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.958333333333333) internal successors, (167), 25 states have internal predecessors, (167), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:26:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2457 transitions. [2024-11-28 02:26:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:26:16,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:16,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:16,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 02:26:17,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 02:26:17,082 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:26:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -28844743, now seen corresponding path program 1 times [2024-11-28 02:26:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:26:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076504470] [2024-11-28 02:26:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:26:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:26:19,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:26:19,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076504470] [2024-11-28 02:26:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076504470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:19,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:26:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815164978] [2024-11-28 02:26:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:26:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:26:19,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:26:19,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:26:19,782 INFO L87 Difference]: Start difference. First operand 1767 states and 2457 transitions. Second operand has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:26:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:42,846 INFO L93 Difference]: Finished difference Result 1852 states and 2562 transitions. [2024-11-28 02:26:42,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:26:42,847 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-28 02:26:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:42,848 INFO L225 Difference]: With dead ends: 1852 [2024-11-28 02:26:42,849 INFO L226 Difference]: Without dead ends: 1852 [2024-11-28 02:26:42,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:26:42,849 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 1025 mSDsluCounter, 4389 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 5025 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:42,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 5025 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3060 Invalid, 0 Unknown, 0 Unchecked, 21.6s Time] [2024-11-28 02:26:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2024-11-28 02:26:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1814. [2024-11-28 02:26:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1511 states have (on average 1.6240900066181336) internal successors, (2454), 1802 states have internal predecessors, (2454), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:26:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2508 transitions. [2024-11-28 02:26:42,872 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2508 transitions. Word has length 112 [2024-11-28 02:26:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:42,872 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2508 transitions. [2024-11-28 02:26:42,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:26:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2508 transitions. [2024-11-28 02:26:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:26:42,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:42,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:42,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 02:26:42,873 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:26:42,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash -28844742, now seen corresponding path program 1 times [2024-11-28 02:26:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:26:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033521425] [2024-11-28 02:26:42,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:26:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:26:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:26:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033521425] [2024-11-28 02:26:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033521425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:26:46,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343978669] [2024-11-28 02:26:46,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:26:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:26:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:26:46,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:26:46,337 INFO L87 Difference]: Start difference. First operand 1814 states and 2508 transitions. Second operand has 16 states, 15 states have (on average 7.333333333333333) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:27:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:27:22,826 INFO L93 Difference]: Finished difference Result 1851 states and 2560 transitions. [2024-11-28 02:27:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:27:22,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.333333333333333) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-28 02:27:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:27:22,829 INFO L225 Difference]: With dead ends: 1851 [2024-11-28 02:27:22,829 INFO L226 Difference]: Without dead ends: 1851 [2024-11-28 02:27:22,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:27:22,830 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 980 mSDsluCounter, 7144 mSDsCounter, 0 mSdLazyCounter, 4965 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 7776 SdHoareTripleChecker+Invalid, 4988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:27:22,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 7776 Invalid, 4988 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 4965 Invalid, 0 Unknown, 0 Unchecked, 34.9s Time] [2024-11-28 02:27:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2024-11-28 02:27:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1814. [2024-11-28 02:27:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1511 states have (on average 1.6227663798808736) internal successors, (2452), 1802 states have internal predecessors, (2452), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:27:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2506 transitions. [2024-11-28 02:27:22,849 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2506 transitions. Word has length 112 [2024-11-28 02:27:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:27:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2506 transitions. [2024-11-28 02:27:22,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.333333333333333) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:27:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2506 transitions. [2024-11-28 02:27:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 02:27:22,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:27:22,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:27:22,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 02:27:22,851 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:27:22,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:27:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1624871030, now seen corresponding path program 1 times [2024-11-28 02:27:22,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:27:22,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403298527] [2024-11-28 02:27:22,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:27:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:27:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:27:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:27:25,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:27:25,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403298527] [2024-11-28 02:27:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403298527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:27:25,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620442975] [2024-11-28 02:27:25,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:27:25,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:27:25,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:27:25,864 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:27:25,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:27:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:27:26,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 02:27:26,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:27:26,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:27:27,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:27:27,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:27:27,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:27:27,738 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:27:27,738 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-28 02:27:28,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:27:28,150 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-28 02:27:28,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:27:28,546 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-28 02:27:28,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:27:28,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:27:29,355 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:27:29,355 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-28 02:27:29,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:27:29,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:27:30,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:27:30,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:27:30,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:27:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:27:30,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:27:30,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3575 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:27:30,196 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3575 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:27:30,286 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:27:30,287 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-28 02:27:30,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3574))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem60#1.base|)) is different from false [2024-11-28 02:27:30,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3574))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:27:30,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3573 (Array Int Int)) (v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3573)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3574))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2024-11-28 02:27:30,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3573 (Array Int Int)) (v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3573))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3574))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:27:30,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3573 (Array Int Int)) (v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3572))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3573)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3574))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:27:31,416 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3573 (Array Int Int)) (v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3571))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3572)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3573)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3574))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:27:32,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3573 (Array Int Int)) (v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3570))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3571)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3572)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3573)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3574))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:27:32,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3573 (Array Int Int)) (v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3578 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3578))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3570)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3571)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3572)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3573)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3574))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3575)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:27:32,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620442975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:27:32,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:27:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 23 [2024-11-28 02:27:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639238254] [2024-11-28 02:27:32,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:27:32,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:27:32,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:27:32,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:27:32,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=612, Unknown=29, NotChecked=590, Total=1332 [2024-11-28 02:27:32,554 INFO L87 Difference]: Start difference. First operand 1814 states and 2506 transitions. Second operand has 24 states, 22 states have (on average 7.5) internal successors, (165), 24 states have internal predecessors, (165), 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-28 02:27:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:27:57,978 INFO L93 Difference]: Finished difference Result 1838 states and 2538 transitions. [2024-11-28 02:27:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:27:57,978 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 7.5) internal successors, (165), 24 states have internal predecessors, (165), 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 113 [2024-11-28 02:27:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:27:57,981 INFO L225 Difference]: With dead ends: 1838 [2024-11-28 02:27:57,981 INFO L226 Difference]: Without dead ends: 1838 [2024-11-28 02:27:57,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=190, Invalid=1227, Unknown=29, NotChecked=810, Total=2256 [2024-11-28 02:27:57,982 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 940 mSDsluCounter, 5004 mSDsCounter, 0 mSdLazyCounter, 3424 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 5640 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:27:57,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 5640 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3424 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2024-11-28 02:27:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-28 02:27:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1813. [2024-11-28 02:27:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1511 states have (on average 1.6214427531436135) internal successors, (2450), 1801 states have internal predecessors, (2450), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 02:27:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2504 transitions. [2024-11-28 02:27:58,005 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2504 transitions. Word has length 113 [2024-11-28 02:27:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:27:58,005 INFO L471 AbstractCegarLoop]: Abstraction has 1813 states and 2504 transitions. [2024-11-28 02:27:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 7.5) internal successors, (165), 24 states have internal predecessors, (165), 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-28 02:27:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2504 transitions. [2024-11-28 02:27:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 02:27:58,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:27:58,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:27:58,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 02:27:58,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-28 02:27:58,207 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:27:58,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:27:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1624871031, now seen corresponding path program 1 times [2024-11-28 02:27:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:27:58,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661293711] [2024-11-28 02:27:58,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:27:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:27:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:28:01,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:28:01,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661293711] [2024-11-28 02:28:01,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661293711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:28:01,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458089808] [2024-11-28 02:28:01,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:01,603 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:28:01,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:28:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:01,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 02:28:01,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:28:02,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:28:03,056 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:28:03,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:28:03,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:28:03,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:28:03,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:28:03,794 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-28 02:28:03,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:28:04,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:28:04,266 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-28 02:28:04,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:28:04,746 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:28:04,746 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-28 02:28:04,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:28:05,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:28:05,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:28:05,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:28:05,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:28:05,729 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-28 02:28:05,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:28:06,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:28:06,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:28:06,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:28:07,168 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:28:07,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:28:07,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:28:07,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:28:07,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:28:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:28:07,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:28:08,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3804 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:28:08,299 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3804 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:28:08,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:28:08,446 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-28 02:28:09,315 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_60 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_59) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3803) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3802))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:28:09,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3801))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3800) .cse0 v_ArrVal_3803) (select (select (store .cse1 .cse0 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3804))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3801))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3802))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse5)))) (forall ((v_prenex_60 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3801))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3800) .cse6 v_prenex_59) (select (select (store .cse7 .cse6 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_60))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:28:09,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_3801))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3802))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_prenex_60 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_3801))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_3800) .cse5 v_prenex_59) (select (select (store .cse6 .cse5 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_60))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_3801))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_3800) .cse7 v_ArrVal_3803) (select (select (store .cse8 .cse7 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3804))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))) is different from false [2024-11-28 02:28:09,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3799))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3801))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3798) .cse0 v_ArrVal_3800) .cse1 v_ArrVal_3803) (select (select (store .cse2 .cse1 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3804))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_prenex_60 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3799))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3801))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3798) .cse5 v_ArrVal_3800) .cse6 v_prenex_59) (select (select (store .cse7 .cse6 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_60))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3799))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3801)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3802))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-28 02:28:14,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse5 v_ArrVal_3799))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3801)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3802))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_prenex_60 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#0.base| .cse5 v_ArrVal_3799))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3801))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse5 v_ArrVal_3798) .cse6 v_ArrVal_3800) .cse7 v_prenex_59) (select (select (store .cse8 .cse7 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_60))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (let ((.cse13 (store |c_#memory_$Pointer$#0.base| .cse5 v_ArrVal_3799))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3801))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse5 v_ArrVal_3798) .cse10 v_ArrVal_3800) .cse11 v_ArrVal_3803) (select (select (store .cse12 .cse11 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3804))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))) is different from false [2024-11-28 02:28:18,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_3796 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3797))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3799))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3801))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3796) .cse0 v_ArrVal_3798) .cse1 v_ArrVal_3800) .cse2 v_prenex_59) (select (select (store .cse3 .cse2 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_60))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3796 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (let ((.cse12 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3797))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_3799))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3801))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3796) .cse7 v_ArrVal_3798) .cse8 v_ArrVal_3800) .cse9 v_ArrVal_3803) (select (select (store .cse10 .cse9 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3804))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3797))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3799)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3801)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_3802))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse15)))))) is different from false [2024-11-28 02:28:23,236 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3796 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3797))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3799))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3801))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3796) .cse1 v_ArrVal_3798) .cse2 v_ArrVal_3800) .cse3 v_ArrVal_3803) (select (select (store .cse4 .cse3 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3804))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_3796 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3797))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3799))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3801))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3796) .cse8 v_ArrVal_3798) .cse9 v_ArrVal_3800) .cse10 v_prenex_59) (select (select (store .cse11 .cse10 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_60))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3797))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3799)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3801)))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse14 (select (select (let ((.cse15 (store .cse16 .cse14 v_ArrVal_3802))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) is different from false [2024-11-28 02:28:27,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int)) (v_ArrVal_3796 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3804 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3795))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3797))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3799))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3801))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3794) .cse0 v_ArrVal_3796) .cse1 v_ArrVal_3798) .cse2 v_ArrVal_3800) .cse3 v_ArrVal_3803) (select (select (store .cse4 .cse3 v_ArrVal_3802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3804))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int)) (v_ArrVal_3796 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_prenex_59 (Array Int Int))) (<= 0 (select (select (let ((.cse16 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3795))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_3797))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3799))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3801))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3794) .cse9 v_ArrVal_3796) .cse10 v_ArrVal_3798) .cse11 v_ArrVal_3800) .cse12 v_prenex_59) (select (select (store .cse13 .cse12 v_prenex_58) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_60))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3805 (Array Int Int)) (v_ArrVal_3795 (Array Int Int)) (v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3802 (Array Int Int))) (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3795))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3797)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3799)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3801)))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse17 (select (select (let ((.cse18 (store .cse19 .cse17 v_ArrVal_3802))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))) is different from false [2024-11-28 02:28:31,575 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 02:28:31,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 02:28:31,576 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 02:28:31,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 02:28:31,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 02:28:31,777 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_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) 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:555) 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:395) 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:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) 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:317) 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:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) 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) ... 46 more [2024-11-28 02:28:31,786 INFO L158 Benchmark]: Toolchain (without parser) took 335739.98ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 90.3MB in the beginning and 364.7MB in the end (delta: -274.5MB). Peak memory consumption was 309.4MB. Max. memory is 16.1GB. [2024-11-28 02:28:31,787 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:28:31,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1008.98ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 56.4MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 02:28:31,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.83ms. Allocated memory is still 117.4MB. Free memory was 56.4MB in the beginning and 48.8MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:28:31,789 INFO L158 Benchmark]: Boogie Preprocessor took 246.74ms. Allocated memory is still 117.4MB. Free memory was 48.8MB in the beginning and 85.4MB in the end (delta: -36.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-28 02:28:31,789 INFO L158 Benchmark]: RCFGBuilder took 3273.24ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 55.1MB in the end (delta: 29.8MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-11-28 02:28:31,789 INFO L158 Benchmark]: TraceAbstraction took 331083.25ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 54.3MB in the beginning and 364.7MB in the end (delta: -310.5MB). Peak memory consumption was 273.4MB. Max. memory is 16.1GB. [2024-11-28 02:28:31,795 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1008.98ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 56.4MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.83ms. Allocated memory is still 117.4MB. Free memory was 56.4MB in the beginning and 48.8MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 246.74ms. Allocated memory is still 117.4MB. Free memory was 48.8MB in the beginning and 85.4MB in the end (delta: -36.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3273.24ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 55.1MB in the end (delta: 29.8MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * TraceAbstraction took 331083.25ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 54.3MB in the beginning and 364.7MB in the end (delta: -310.5MB). Peak memory consumption was 273.4MB. 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_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/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_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/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_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:28:34,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:28:34,419 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 02:28:34,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:28:34,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:28:34,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:28:34,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:28:34,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:28:34,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:28:34,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:28:34,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:28:34,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:28:34,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:28:34,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:28:34,494 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:28:34,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:28:34,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:28:34,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:28:34,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:28:34,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:28:34,495 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:28:34,495 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:28:34,496 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:28:34,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:28:34,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:28:34,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:28:34,496 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:28:34,496 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:28:34,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:28:34,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:28:34,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:28:34,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:28:34,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:28:34,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:28:34,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:28:34,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:28:34,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:28:34,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:28:34,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:28:34,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:28:34,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:28:34,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:28:34,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:28:34,500 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:28:34,500 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:28:34,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:28:34,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:28:34,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:28:34,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:28:34,501 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_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e [2024-11-28 02:28:34,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:28:34,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:28:34,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:28:34,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:28:34,902 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:28:34,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2024-11-28 02:28:37,979 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/ea2c05617/bd6ceecff2c34afea10508f248132e26/FLAGe8347f165 [2024-11-28 02:28:38,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:28:38,422 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2024-11-28 02:28:38,449 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/ea2c05617/bd6ceecff2c34afea10508f248132e26/FLAGe8347f165 [2024-11-28 02:28:38,476 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/data/ea2c05617/bd6ceecff2c34afea10508f248132e26 [2024-11-28 02:28:38,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:28:38,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:28:38,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:28:38,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:28:38,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:28:38,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:28:38" (1/1) ... [2024-11-28 02:28:38,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2800213d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:38, skipping insertion in model container [2024-11-28 02:28:38,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:28:38" (1/1) ... [2024-11-28 02:28:38,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:28:39,026 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,082 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,090 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,096 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,107 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,151 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,151 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,156 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,156 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:28:39,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:28:39,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:28:39,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:28:39,388 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:28:39,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39 WrapperNode [2024-11-28 02:28:39,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:28:39,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:28:39,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:28:39,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:28:39,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,521 INFO L138 Inliner]: procedures = 211, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 885 [2024-11-28 02:28:39,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:28:39,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:28:39,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:28:39,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:28:39,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,652 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [34, 2, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2024-11-28 02:28:39,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:28:39,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:28:39,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:28:39,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:28:39,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (1/1) ... [2024-11-28 02:28:39,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:28:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:39,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:28:39,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:28:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 02:28:39,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:28:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 02:28:39,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:28:39,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:28:39,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:28:39,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:28:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:28:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:28:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:28:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:28:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:28:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:28:39,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:28:40,079 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:28:40,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:28:40,111 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:28:40,164 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:28:40,199 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:28:44,763 INFO L? ?]: Removed 878 outVars from TransFormulas that were not future-live. [2024-11-28 02:28:44,764 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:28:44,801 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:28:44,802 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-28 02:28:44,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:28:44 BoogieIcfgContainer [2024-11-28 02:28:44,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:28:44,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:28:44,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:28:44,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:28:44,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:28:38" (1/3) ... [2024-11-28 02:28:44,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d3db90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:28:44, skipping insertion in model container [2024-11-28 02:28:44,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:28:39" (2/3) ... [2024-11-28 02:28:44,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d3db90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:28:44, skipping insertion in model container [2024-11-28 02:28:44,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:28:44" (3/3) ... [2024-11-28 02:28:44,817 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-1.i [2024-11-28 02:28:44,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:28:44,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test2-1.i that has 6 procedures, 893 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2024-11-28 02:28:44,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:28:44,910 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;@49da7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:28:44,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-28 02:28:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 883 states, 448 states have (on average 2.1875) internal successors, (980), 876 states have internal predecessors, (980), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-28 02:28:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:28:44,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:28:44,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:28:44,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:28:44,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:28:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-28 02:28:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:28:44,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068062557] [2024-11-28 02:28:44,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:44,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:44,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:44,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:28:44,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:28:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:45,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:28:45,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:28:45,197 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-28 02:28:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:28:45,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:28:45,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:28:45,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068062557] [2024-11-28 02:28:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068062557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:28:45,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:28:45,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:28:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132279410] [2024-11-28 02:28:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:28:45,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:28:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:28:45,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:28:45,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:28:45,281 INFO L87 Difference]: Start difference. First operand has 883 states, 448 states have (on average 2.1875) internal successors, (980), 876 states have internal predecessors, (980), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:28:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:28:47,225 INFO L93 Difference]: Finished difference Result 869 states and 926 transitions. [2024-11-28 02:28:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:28:47,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 02:28:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:28:47,242 INFO L225 Difference]: With dead ends: 869 [2024-11-28 02:28:47,243 INFO L226 Difference]: Without dead ends: 867 [2024-11-28 02:28:47,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:28:47,248 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 791 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:28:47,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 589 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:28:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-28 02:28:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2024-11-28 02:28:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 450 states have (on average 2.013333333333333) internal successors, (906), 860 states have internal predecessors, (906), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-28 02:28:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 924 transitions. [2024-11-28 02:28:47,341 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 924 transitions. Word has length 3 [2024-11-28 02:28:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:28:47,341 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 924 transitions. [2024-11-28 02:28:47,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:28:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 924 transitions. [2024-11-28 02:28:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:28:47,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:28:47,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:28:47,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:28:47,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:47,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:28:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:28:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-28 02:28:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:28:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670538530] [2024-11-28 02:28:47,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:47,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:47,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:47,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:28:47,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:28:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:47,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:28:47,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:28:47,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:28:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:28:47,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:28:47,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:28:47,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670538530] [2024-11-28 02:28:47,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670538530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:28:47,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:28:47,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:28:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914529520] [2024-11-28 02:28:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:28:47,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:28:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:28:47,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:28:47,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:28:47,714 INFO L87 Difference]: Start difference. First operand 867 states and 924 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:28:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:28:50,092 INFO L93 Difference]: Finished difference Result 1094 states and 1183 transitions. [2024-11-28 02:28:50,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:28:50,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 02:28:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:28:50,098 INFO L225 Difference]: With dead ends: 1094 [2024-11-28 02:28:50,098 INFO L226 Difference]: Without dead ends: 1094 [2024-11-28 02:28:50,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:28:50,099 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 248 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:28:50,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1307 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 02:28:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-11-28 02:28:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1005. [2024-11-28 02:28:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 584 states have (on average 1.9726027397260273) internal successors, (1152), 998 states have internal predecessors, (1152), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:28:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1180 transitions. [2024-11-28 02:28:50,133 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1180 transitions. Word has length 3 [2024-11-28 02:28:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:28:50,134 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1180 transitions. [2024-11-28 02:28:50,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:28:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1180 transitions. [2024-11-28 02:28:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 02:28:50,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:28:50,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:28:50,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:28:50,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:50,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:28:50,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:28:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1329215633, now seen corresponding path program 1 times [2024-11-28 02:28:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:28:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329659141] [2024-11-28 02:28:50,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:50,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:50,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:50,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:28:50,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:28:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:50,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 02:28:50,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:28:50,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:28:50,493 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-28 02:28:50,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:28:50,593 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 12 treesize of output 14 [2024-11-28 02:28:50,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:28:50,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:28:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:28:50,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:28:50,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:28:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329659141] [2024-11-28 02:28:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329659141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:28:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:28:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:28:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474398688] [2024-11-28 02:28:50,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:28:50,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:28:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:28:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:28:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:28:50,669 INFO L87 Difference]: Start difference. First operand 1005 states and 1180 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:28:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:28:57,938 INFO L93 Difference]: Finished difference Result 2084 states and 2350 transitions. [2024-11-28 02:28:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:28:57,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-28 02:28:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:28:57,947 INFO L225 Difference]: With dead ends: 2084 [2024-11-28 02:28:57,947 INFO L226 Difference]: Without dead ends: 2084 [2024-11-28 02:28:57,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:28:57,949 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 1429 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:28:57,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 1114 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-28 02:28:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2024-11-28 02:28:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1192. [2024-11-28 02:28:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 771 states have (on average 1.972762645914397) internal successors, (1521), 1183 states have internal predecessors, (1521), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:28:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1553 transitions. [2024-11-28 02:28:57,990 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1553 transitions. Word has length 8 [2024-11-28 02:28:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:28:57,990 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1553 transitions. [2024-11-28 02:28:57,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:28:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1553 transitions. [2024-11-28 02:28:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:28:57,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:28:57,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:28:58,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:28:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:58,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:28:58,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:28:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2024-11-28 02:28:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:28:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186203473] [2024-11-28 02:28:58,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:28:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:28:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:28:58,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:28:58,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:28:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:28:58,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:28:58,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:28:58,345 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-28 02:28:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:28:58,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:28:58,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:28:58,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186203473] [2024-11-28 02:28:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186203473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:28:58,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:28:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:28:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696220673] [2024-11-28 02:28:58,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:28:58,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:28:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:28:58,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:28:58,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:28:58,369 INFO L87 Difference]: Start difference. First operand 1192 states and 1553 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:00,296 INFO L93 Difference]: Finished difference Result 1373 states and 1742 transitions. [2024-11-28 02:29:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:29:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:29:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:00,302 INFO L225 Difference]: With dead ends: 1373 [2024-11-28 02:29:00,302 INFO L226 Difference]: Without dead ends: 1373 [2024-11-28 02:29:00,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:29:00,303 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 776 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:00,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 895 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:29:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-28 02:29:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1145. [2024-11-28 02:29:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 771 states have (on average 1.880674448767834) internal successors, (1450), 1136 states have internal predecessors, (1450), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:29:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1482 transitions. [2024-11-28 02:29:00,334 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1482 transitions. Word has length 9 [2024-11-28 02:29:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:00,335 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1482 transitions. [2024-11-28 02:29:00,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1482 transitions. [2024-11-28 02:29:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:29:00,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:00,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:00,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:29:00,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:00,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:00,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2024-11-28 02:29:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:00,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008377245] [2024-11-28 02:29:00,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:00,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:00,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:00,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:00,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:29:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:00,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:29:00,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:00,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:29:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:00,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:00,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008377245] [2024-11-28 02:29:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008377245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:00,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:00,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:29:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675305388] [2024-11-28 02:29:00,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:00,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:29:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:00,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:29:00,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:29:00,701 INFO L87 Difference]: Start difference. First operand 1145 states and 1482 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:03,249 INFO L93 Difference]: Finished difference Result 1645 states and 2161 transitions. [2024-11-28 02:29:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:29:03,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:29:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:03,257 INFO L225 Difference]: With dead ends: 1645 [2024-11-28 02:29:03,257 INFO L226 Difference]: Without dead ends: 1645 [2024-11-28 02:29:03,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:29:03,258 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 529 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:03,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1239 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:29:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-28 02:29:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1207. [2024-11-28 02:29:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 843 states have (on average 1.8695136417556346) internal successors, (1576), 1198 states have internal predecessors, (1576), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:29:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1608 transitions. [2024-11-28 02:29:03,296 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1608 transitions. Word has length 9 [2024-11-28 02:29:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:03,297 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1608 transitions. [2024-11-28 02:29:03,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1608 transitions. [2024-11-28 02:29:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 02:29:03,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:03,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:03,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:29:03,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:03,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:03,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1596395452, now seen corresponding path program 1 times [2024-11-28 02:29:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:03,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450610628] [2024-11-28 02:29:03,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:03,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:03,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:03,503 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:03,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:29:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:03,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:29:03,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:03,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:29:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:03,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:03,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:03,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450610628] [2024-11-28 02:29:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450610628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:03,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:03,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:29:03,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424887229] [2024-11-28 02:29:03,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:03,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:29:03,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:03,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:29:03,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:29:03,662 INFO L87 Difference]: Start difference. First operand 1207 states and 1608 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:04,255 INFO L93 Difference]: Finished difference Result 2157 states and 2776 transitions. [2024-11-28 02:29:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:29:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 02:29:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:04,265 INFO L225 Difference]: With dead ends: 2157 [2024-11-28 02:29:04,265 INFO L226 Difference]: Without dead ends: 2157 [2024-11-28 02:29:04,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:04,267 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 805 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:04,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2425 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:29:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2024-11-28 02:29:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1209. [2024-11-28 02:29:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 845 states have (on average 1.8674556213017752) internal successors, (1578), 1200 states have internal predecessors, (1578), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:29:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1610 transitions. [2024-11-28 02:29:04,341 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1610 transitions. Word has length 10 [2024-11-28 02:29:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:04,342 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1610 transitions. [2024-11-28 02:29:04,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1610 transitions. [2024-11-28 02:29:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 02:29:04,343 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:04,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:04,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:29:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:04,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:04,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:04,544 INFO L85 PathProgramCache]: Analyzing trace with hash 495195041, now seen corresponding path program 1 times [2024-11-28 02:29:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921219786] [2024-11-28 02:29:04,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:04,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:04,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:04,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:04,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:29:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:04,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:29:04,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:04,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:04,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921219786] [2024-11-28 02:29:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921219786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:04,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:04,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:29:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947358064] [2024-11-28 02:29:04,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:04,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:29:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:04,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:29:04,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:29:04,772 INFO L87 Difference]: Start difference. First operand 1209 states and 1610 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:06,862 INFO L93 Difference]: Finished difference Result 1195 states and 1573 transitions. [2024-11-28 02:29:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:29:06,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-28 02:29:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:06,867 INFO L225 Difference]: With dead ends: 1195 [2024-11-28 02:29:06,867 INFO L226 Difference]: Without dead ends: 1195 [2024-11-28 02:29:06,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:06,869 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 825 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:06,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 813 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 02:29:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2024-11-28 02:29:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1186. [2024-11-28 02:29:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 845 states have (on average 1.81301775147929) internal successors, (1532), 1177 states have internal predecessors, (1532), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:29:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1564 transitions. [2024-11-28 02:29:06,901 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1564 transitions. Word has length 19 [2024-11-28 02:29:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:06,901 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1564 transitions. [2024-11-28 02:29:06,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1564 transitions. [2024-11-28 02:29:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 02:29:06,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:06,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:06,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 02:29:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:07,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:07,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 495195042, now seen corresponding path program 1 times [2024-11-28 02:29:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516273730] [2024-11-28 02:29:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:07,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:07,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:07,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:07,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:29:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:07,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:29:07,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:07,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:29:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:07,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:07,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:07,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516273730] [2024-11-28 02:29:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516273730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:07,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:29:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482024133] [2024-11-28 02:29:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:29:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:07,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:29:07,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:29:07,426 INFO L87 Difference]: Start difference. First operand 1186 states and 1564 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:11,065 INFO L93 Difference]: Finished difference Result 1756 states and 2273 transitions. [2024-11-28 02:29:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:29:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-28 02:29:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:11,071 INFO L225 Difference]: With dead ends: 1756 [2024-11-28 02:29:11,071 INFO L226 Difference]: Without dead ends: 1756 [2024-11-28 02:29:11,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:11,072 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 650 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:11,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1366 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 02:29:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2024-11-28 02:29:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1302. [2024-11-28 02:29:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 961 states have (on average 1.7398543184183142) internal successors, (1672), 1293 states have internal predecessors, (1672), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:29:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1704 transitions. [2024-11-28 02:29:11,101 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1704 transitions. Word has length 19 [2024-11-28 02:29:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:11,101 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1704 transitions. [2024-11-28 02:29:11,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1704 transitions. [2024-11-28 02:29:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 02:29:11,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:11,102 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:11,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 02:29:11,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:11,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:11,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1991006148, now seen corresponding path program 1 times [2024-11-28 02:29:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:11,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003249110] [2024-11-28 02:29:11,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:11,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:11,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:29:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:11,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 02:29:11,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:11,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:29:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:11,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:29:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:12,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003249110] [2024-11-28 02:29:12,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003249110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:29:12,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:29:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 02:29:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462639086] [2024-11-28 02:29:12,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:29:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:29:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:12,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:29:12,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:29:12,619 INFO L87 Difference]: Start difference. First operand 1302 states and 1704 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:20,718 INFO L93 Difference]: Finished difference Result 2118 states and 2769 transitions. [2024-11-28 02:29:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:29:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 02:29:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:20,729 INFO L225 Difference]: With dead ends: 2118 [2024-11-28 02:29:20,729 INFO L226 Difference]: Without dead ends: 2118 [2024-11-28 02:29:20,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:29:20,730 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1422 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:20,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 2229 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-28 02:29:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2024-11-28 02:29:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1468. [2024-11-28 02:29:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1127 states have (on average 1.6912156166814551) internal successors, (1906), 1459 states have internal predecessors, (1906), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:29:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1938 transitions. [2024-11-28 02:29:20,765 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1938 transitions. Word has length 38 [2024-11-28 02:29:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:20,765 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1938 transitions. [2024-11-28 02:29:20,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1938 transitions. [2024-11-28 02:29:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 02:29:20,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:20,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:20,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:29:20,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:20,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:20,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1880354434, now seen corresponding path program 1 times [2024-11-28 02:29:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521341182] [2024-11-28 02:29:20,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:20,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:20,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:20,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:20,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:29:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:21,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:29:21,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:21,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:21,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521341182] [2024-11-28 02:29:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521341182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:21,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:29:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356844131] [2024-11-28 02:29:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:21,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:29:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:21,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:29:21,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:29:21,503 INFO L87 Difference]: Start difference. First operand 1468 states and 1938 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:21,635 INFO L93 Difference]: Finished difference Result 1970 states and 2595 transitions. [2024-11-28 02:29:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:29:21,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-28 02:29:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:21,642 INFO L225 Difference]: With dead ends: 1970 [2024-11-28 02:29:21,642 INFO L226 Difference]: Without dead ends: 1970 [2024-11-28 02:29:21,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:29:21,643 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 241 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:21,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1760 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:29:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2024-11-28 02:29:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1890. [2024-11-28 02:29:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1539 states have (on average 1.650422352176738) internal successors, (2540), 1881 states have internal predecessors, (2540), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:29:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2592 transitions. [2024-11-28 02:29:21,680 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2592 transitions. Word has length 51 [2024-11-28 02:29:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:21,681 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2592 transitions. [2024-11-28 02:29:21,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2592 transitions. [2024-11-28 02:29:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 02:29:21,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:21,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:21,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:29:21,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:21,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1728836185, now seen corresponding path program 1 times [2024-11-28 02:29:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886884005] [2024-11-28 02:29:21,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:21,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:21,889 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:21,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:29:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:22,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:29:22,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:22,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:22,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886884005] [2024-11-28 02:29:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886884005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:22,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:29:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882436288] [2024-11-28 02:29:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:22,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:29:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:22,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:29:22,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:29:22,176 INFO L87 Difference]: Start difference. First operand 1890 states and 2592 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-28 02:29:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:22,299 INFO L93 Difference]: Finished difference Result 1429 states and 1932 transitions. [2024-11-28 02:29:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:29:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-28 02:29:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:22,309 INFO L225 Difference]: With dead ends: 1429 [2024-11-28 02:29:22,309 INFO L226 Difference]: Without dead ends: 1429 [2024-11-28 02:29:22,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:22,311 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 56 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:22,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2243 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:29:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-28 02:29:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1426. [2024-11-28 02:29:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1098 states have (on average 1.709471766848816) internal successors, (1877), 1417 states have internal predecessors, (1877), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:29:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1929 transitions. [2024-11-28 02:29:22,338 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1929 transitions. Word has length 54 [2024-11-28 02:29:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:22,338 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1929 transitions. [2024-11-28 02:29:22,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-28 02:29:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1929 transitions. [2024-11-28 02:29:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 02:29:22,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:22,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:22,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 02:29:22,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:22,545 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:22,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash 199933403, now seen corresponding path program 1 times [2024-11-28 02:29:22,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:22,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807487148] [2024-11-28 02:29:22,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:22,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:22,549 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:22,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:29:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:22,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 02:29:22,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:22,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:29:23,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:29:23,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:29:23,428 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:29:23,429 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-28 02:29:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:23,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:23,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:23,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807487148] [2024-11-28 02:29:23,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807487148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:29:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715607213] [2024-11-28 02:29:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:23,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:29:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:23,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:29:23,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:23,439 INFO L87 Difference]: Start difference. First operand 1426 states and 1929 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:25,904 INFO L93 Difference]: Finished difference Result 1388 states and 1877 transitions. [2024-11-28 02:29:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:29:25,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-28 02:29:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:25,910 INFO L225 Difference]: With dead ends: 1388 [2024-11-28 02:29:25,910 INFO L226 Difference]: Without dead ends: 1388 [2024-11-28 02:29:25,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 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-28 02:29:25,911 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1375 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:25,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 514 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 02:29:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-28 02:29:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1316. [2024-11-28 02:29:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1026 states have (on average 1.6364522417153997) internal successors, (1679), 1307 states have internal predecessors, (1679), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:29:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1731 transitions. [2024-11-28 02:29:25,932 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1731 transitions. Word has length 62 [2024-11-28 02:29:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:25,933 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1731 transitions. [2024-11-28 02:29:25,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1731 transitions. [2024-11-28 02:29:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 02:29:25,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:25,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:25,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 02:29:26,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:26,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:26,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash -543313183, now seen corresponding path program 1 times [2024-11-28 02:29:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440082675] [2024-11-28 02:29:26,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:26,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:26,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:26,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:26,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:29:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:26,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:29:26,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:26,357 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-28 02:29:26,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:29:26,410 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-28 02:29:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:26,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:26,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:26,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440082675] [2024-11-28 02:29:26,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440082675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:26,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:29:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687375291] [2024-11-28 02:29:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:29:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:26,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:29:26,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:26,426 INFO L87 Difference]: Start difference. First operand 1316 states and 1731 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:28,526 INFO L93 Difference]: Finished difference Result 1315 states and 1729 transitions. [2024-11-28 02:29:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:29:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-28 02:29:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:28,530 INFO L225 Difference]: With dead ends: 1315 [2024-11-28 02:29:28,530 INFO L226 Difference]: Without dead ends: 1315 [2024-11-28 02:29:28,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-28 02:29:28,531 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 2 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:28,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1991 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:29:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-28 02:29:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2024-11-28 02:29:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1026 states have (on average 1.6345029239766082) internal successors, (1677), 1306 states have internal predecessors, (1677), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:29:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1729 transitions. [2024-11-28 02:29:28,552 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1729 transitions. Word has length 67 [2024-11-28 02:29:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:28,553 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1729 transitions. [2024-11-28 02:29:28,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1729 transitions. [2024-11-28 02:29:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 02:29:28,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:28,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:28,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 02:29:28,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:28,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -543313182, now seen corresponding path program 1 times [2024-11-28 02:29:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:28,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761398977] [2024-11-28 02:29:28,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:28,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:28,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:28,758 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:28,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 02:29:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:28,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:29:28,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:28,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:29:29,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:29:29,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:29:29,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-28 02:29:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:29,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:29,124 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:29,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761398977] [2024-11-28 02:29:29,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761398977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:29,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:29,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:29:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858838802] [2024-11-28 02:29:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:29,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:29:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:29,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:29:29,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:29:29,127 INFO L87 Difference]: Start difference. First operand 1315 states and 1729 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:31,897 INFO L93 Difference]: Finished difference Result 1314 states and 1727 transitions. [2024-11-28 02:29:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:29:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-28 02:29:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:31,901 INFO L225 Difference]: With dead ends: 1314 [2024-11-28 02:29:31,901 INFO L226 Difference]: Without dead ends: 1314 [2024-11-28 02:29:31,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-28 02:29:31,902 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:31,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1975 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 02:29:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-28 02:29:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2024-11-28 02:29:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1024 states have (on average 1.6357421875) internal successors, (1675), 1305 states have internal predecessors, (1675), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:29:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1727 transitions. [2024-11-28 02:29:31,922 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1727 transitions. Word has length 67 [2024-11-28 02:29:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:31,923 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1727 transitions. [2024-11-28 02:29:31,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:29:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1727 transitions. [2024-11-28 02:29:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 02:29:31,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:31,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:31,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 02:29:32,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:32,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:32,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2144873352, now seen corresponding path program 1 times [2024-11-28 02:29:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:32,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674593892] [2024-11-28 02:29:32,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:32,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:32,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:32,127 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:32,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 02:29:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:32,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 02:29:32,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:32,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:29:32,465 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-28 02:29:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:32,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:32,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:32,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674593892] [2024-11-28 02:29:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674593892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:32,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:32,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:29:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645501147] [2024-11-28 02:29:32,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:32,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:29:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:32,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:29:32,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:29:32,481 INFO L87 Difference]: Start difference. First operand 1314 states and 1727 transitions. Second operand has 7 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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-28 02:29:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:35,111 INFO L93 Difference]: Finished difference Result 1332 states and 1753 transitions. [2024-11-28 02:29:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:29:35,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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 75 [2024-11-28 02:29:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:35,115 INFO L225 Difference]: With dead ends: 1332 [2024-11-28 02:29:35,115 INFO L226 Difference]: Without dead ends: 1332 [2024-11-28 02:29:35,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 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-28 02:29:35,116 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 13 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:35,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2752 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:29:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-28 02:29:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1323. [2024-11-28 02:29:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1032 states have (on average 1.6337209302325582) internal successors, (1686), 1312 states have internal predecessors, (1686), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-28 02:29:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1743 transitions. [2024-11-28 02:29:35,139 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1743 transitions. Word has length 75 [2024-11-28 02:29:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:35,139 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1743 transitions. [2024-11-28 02:29:35,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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-28 02:29:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1743 transitions. [2024-11-28 02:29:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 02:29:35,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:35,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:35,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 02:29:35,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:35,341 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2144873353, now seen corresponding path program 1 times [2024-11-28 02:29:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:35,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92690276] [2024-11-28 02:29:35,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:35,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:35,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:35,343 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:35,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 02:29:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:35,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:29:35,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:35,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:29:35,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:35,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92690276] [2024-11-28 02:29:35,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92690276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:29:35,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:29:35,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:29:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296770339] [2024-11-28 02:29:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:29:35,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:29:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:35,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:29:35,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:29:35,615 INFO L87 Difference]: Start difference. First operand 1323 states and 1743 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-28 02:29:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:35,673 INFO L93 Difference]: Finished difference Result 1317 states and 1731 transitions. [2024-11-28 02:29:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:29:35,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2024-11-28 02:29:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:35,679 INFO L225 Difference]: With dead ends: 1317 [2024-11-28 02:29:35,679 INFO L226 Difference]: Without dead ends: 1317 [2024-11-28 02:29:35,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 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-28 02:29:35,680 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 0 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2230 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.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:35,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2230 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:29:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-28 02:29:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2024-11-28 02:29:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1026 states have (on average 1.635477582846004) internal successors, (1678), 1308 states have internal predecessors, (1678), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:29:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1731 transitions. [2024-11-28 02:29:35,705 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1731 transitions. Word has length 75 [2024-11-28 02:29:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:35,705 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1731 transitions. [2024-11-28 02:29:35,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-28 02:29:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1731 transitions. [2024-11-28 02:29:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-28 02:29:35,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:35,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:35,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 02:29:35,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:35,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:35,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1028065756, now seen corresponding path program 1 times [2024-11-28 02:29:35,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:35,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189086425] [2024-11-28 02:29:35,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:29:35,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:35,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:35,911 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:35,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 02:29:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:29:36,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:29:36,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:36,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:29:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:36,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:36,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189086425] [2024-11-28 02:29:36,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189086425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:29:36,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:29:36,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-28 02:29:36,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600991435] [2024-11-28 02:29:36,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:29:36,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:29:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:36,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:29:36,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:29:36,261 INFO L87 Difference]: Start difference. First operand 1317 states and 1731 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-28 02:29:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:29:36,537 INFO L93 Difference]: Finished difference Result 1329 states and 1748 transitions. [2024-11-28 02:29:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:29:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2024-11-28 02:29:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:29:36,542 INFO L225 Difference]: With dead ends: 1329 [2024-11-28 02:29:36,542 INFO L226 Difference]: Without dead ends: 1329 [2024-11-28 02:29:36,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 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-28 02:29:36,543 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 5 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3710 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:29:36,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3710 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:29:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2024-11-28 02:29:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1327. [2024-11-28 02:29:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1035 states have (on average 1.6357487922705314) internal successors, (1693), 1317 states have internal predecessors, (1693), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:29:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1746 transitions. [2024-11-28 02:29:36,566 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1746 transitions. Word has length 76 [2024-11-28 02:29:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:29:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1746 transitions. [2024-11-28 02:29:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-28 02:29:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1746 transitions. [2024-11-28 02:29:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-28 02:29:36,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:29:36,568 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:29:36,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 02:29:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:36,769 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:29:36,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:29:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1761348984, now seen corresponding path program 2 times [2024-11-28 02:29:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:29:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85022041] [2024-11-28 02:29:36,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:29:36,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:29:36,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:29:36,772 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:29:36,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 02:29:50,966 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:29:50,966 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:29:50,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 02:29:50,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:51,157 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:29:51,158 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-28 02:29:51,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:29:51,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:29:51,438 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-28 02:29:51,497 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-28 02:29:51,527 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-28 02:29:51,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:29:51,650 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 02:29:51,651 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-28 02:29:51,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:29:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85022041] [2024-11-28 02:29:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85022041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:29:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2002407749] [2024-11-28 02:29:51,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:29:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:29:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:29:51,714 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:29:51,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-28 02:29:52,958 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:29:52,959 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:29:52,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 02:29:52,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:29:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:53,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:29:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:29:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2002407749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:29:53,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:29:53,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-28 02:29:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293066294] [2024-11-28 02:29:53,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:29:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:29:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:29:53,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:29:53,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=553, Unknown=6, NotChecked=0, Total=650 [2024-11-28 02:29:53,485 INFO L87 Difference]: Start difference. First operand 1327 states and 1746 transitions. Second operand has 24 states, 23 states have (on average 6.217391304347826) internal successors, (143), 23 states have internal predecessors, (143), 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-28 02:30:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:03,152 INFO L93 Difference]: Finished difference Result 1343 states and 1768 transitions. [2024-11-28 02:30:03,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 02:30:03,153 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.217391304347826) internal successors, (143), 23 states have internal predecessors, (143), 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 79 [2024-11-28 02:30:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:03,160 INFO L225 Difference]: With dead ends: 1343 [2024-11-28 02:30:03,161 INFO L226 Difference]: Without dead ends: 1339 [2024-11-28 02:30:03,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=416, Invalid=2332, Unknown=8, NotChecked=0, Total=2756 [2024-11-28 02:30:03,163 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 738 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 4445 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 4793 SdHoareTripleChecker+Invalid, 4472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:03,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 4793 Invalid, 4472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4445 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-28 02:30:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-28 02:30:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1335. [2024-11-28 02:30:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1044 states have (on average 1.6312260536398469) internal successors, (1703), 1325 states have internal predecessors, (1703), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:30:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1756 transitions. [2024-11-28 02:30:03,188 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1756 transitions. Word has length 79 [2024-11-28 02:30:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:03,189 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 1756 transitions. [2024-11-28 02:30:03,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.217391304347826) internal successors, (143), 23 states have internal predecessors, (143), 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-28 02:30:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1756 transitions. [2024-11-28 02:30:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 02:30:03,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:03,190 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:03,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-28 02:30:03,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-28 02:30:03,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:30:03,591 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:30:03,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1706947319, now seen corresponding path program 1 times [2024-11-28 02:30:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:03,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113331801] [2024-11-28 02:30:03,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:30:03,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:30:03,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:30:03,593 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:30:03,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 02:30:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:30:03,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 02:30:03,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:04,078 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-28 02:30:04,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:04,764 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-28 02:30:04,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113331801] [2024-11-28 02:30:04,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113331801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:30:04,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:30:04,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-28 02:30:04,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636715344] [2024-11-28 02:30:04,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:30:04,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:30:04,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:04,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:30:04,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:30:04,768 INFO L87 Difference]: Start difference. First operand 1335 states and 1756 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-28 02:30:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:30:07,855 INFO L93 Difference]: Finished difference Result 1359 states and 1795 transitions. [2024-11-28 02:30:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 02:30:07,856 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2024-11-28 02:30:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:30:07,860 INFO L225 Difference]: With dead ends: 1359 [2024-11-28 02:30:07,860 INFO L226 Difference]: Without dead ends: 1353 [2024-11-28 02:30:07,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 02:30:07,861 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 19 mSDsluCounter, 8164 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8909 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:30:07,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8909 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:30:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-28 02:30:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-28 02:30:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1062 states have (on average 1.625235404896422) internal successors, (1726), 1343 states have internal predecessors, (1726), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:30:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1779 transitions. [2024-11-28 02:30:07,888 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1779 transitions. Word has length 85 [2024-11-28 02:30:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:30:07,889 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1779 transitions. [2024-11-28 02:30:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-28 02:30:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1779 transitions. [2024-11-28 02:30:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 02:30:07,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:30:07,890 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:30:07,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 02:30:08,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:30:08,091 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:30:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:30:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash 848077321, now seen corresponding path program 2 times [2024-11-28 02:30:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:30:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454159450] [2024-11-28 02:30:08,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:30:08,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:30:08,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:30:08,096 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:30:08,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 02:30:23,569 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:30:23,569 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:30:23,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 02:30:23,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:23,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:30:23,742 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:30:23,742 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-28 02:30:23,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:30:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:30:23,929 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-28 02:30:23,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:30:24,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:30:24,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:30:24,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:30:24,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:30:24,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:30:24,670 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-28 02:30:24,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:25,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1176 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1175 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-28 02:30:25,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:30:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454159450] [2024-11-28 02:30:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454159450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:30:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [100556916] [2024-11-28 02:30:25,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:30:25,327 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:30:25,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:30:25,328 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:30:25,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-28 02:30:27,058 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:30:27,058 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:30:27,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 02:30:27,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:30:28,259 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-28 02:30:28,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:30:31,231 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-28 02:30:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [100556916] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:30:31,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:30:31,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-28 02:30:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880935388] [2024-11-28 02:30:31,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:30:31,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 02:30:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:30:31,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 02:30:31,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-28 02:30:31,235 INFO L87 Difference]: Start difference. First operand 1353 states and 1779 transitions. Second operand has 58 states, 57 states have (on average 3.1403508771929824) internal successors, (179), 58 states have internal predecessors, (179), 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-28 02:31:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:31:18,233 INFO L93 Difference]: Finished difference Result 1396 states and 1851 transitions. [2024-11-28 02:31:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-28 02:31:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.1403508771929824) internal successors, (179), 58 states have internal predecessors, (179), 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 97 [2024-11-28 02:31:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:31:18,237 INFO L225 Difference]: With dead ends: 1396 [2024-11-28 02:31:18,237 INFO L226 Difference]: Without dead ends: 1388 [2024-11-28 02:31:18,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3106, Invalid=14987, Unknown=1, NotChecked=266, Total=18360 [2024-11-28 02:31:18,256 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 757 mSDsluCounter, 12601 mSDsCounter, 0 mSdLazyCounter, 13978 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 13022 SdHoareTripleChecker+Invalid, 14045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 13978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:31:18,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 13022 Invalid, 14045 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [67 Valid, 13978 Invalid, 0 Unknown, 0 Unchecked, 36.7s Time] [2024-11-28 02:31:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-28 02:31:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1386. [2024-11-28 02:31:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1096 states have (on average 1.6113138686131387) internal successors, (1766), 1376 states have internal predecessors, (1766), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:31:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1819 transitions. [2024-11-28 02:31:18,293 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1819 transitions. Word has length 97 [2024-11-28 02:31:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:31:18,293 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1819 transitions. [2024-11-28 02:31:18,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.1403508771929824) internal successors, (179), 58 states have internal predecessors, (179), 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-28 02:31:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1819 transitions. [2024-11-28 02:31:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-28 02:31:18,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:31:18,295 INFO L218 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] [2024-11-28 02:31:18,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-28 02:31:18,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 02:31:18,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:31:18,696 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:31:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:31:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1805218046, now seen corresponding path program 1 times [2024-11-28 02:31:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:31:18,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619290071] [2024-11-28 02:31:18,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:31:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:31:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:31:18,703 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:31:18,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 02:31:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:31:19,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 02:31:19,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:31:19,169 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-28 02:31:19,307 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:31:19,307 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-28 02:31:19,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:31:19,973 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:31:19,973 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-28 02:31:20,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:31:20,082 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-28 02:31:20,100 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-28 02:31:20,121 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-28 02:31:20,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:31:20,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1745) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2024-11-28 02:31:20,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:31:20,632 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-28 02:31:20,633 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-28 02:31:20,647 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1791))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 02:31:20,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:31:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619290071] [2024-11-28 02:31:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619290071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:31:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551059437] [2024-11-28 02:31:20,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:31:20,650 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:31:20,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:31:20,653 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:31:20,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-28 02:31:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:31:24,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 02:31:24,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:31:24,123 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-28 02:31:24,272 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 02:31:24,273 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 27 [2024-11-28 02:31:24,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:31:24,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 02:31:25,636 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:31:25,637 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-28 02:31:25,784 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:31:25,785 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-28 02:31:25,818 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-28 02:31:25,868 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-28 02:31:25,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:31:25,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2169) |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-28 02:31:25,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2169 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:31:26,316 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2169 (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$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2215))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:31:26,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [551059437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:31:26,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:31:26,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-28 02:31:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428543768] [2024-11-28 02:31:26,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:31:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:31:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:31:26,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:31:26,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=320, Unknown=6, NotChecked=246, Total=650 [2024-11-28 02:31:26,320 INFO L87 Difference]: Start difference. First operand 1386 states and 1819 transitions. Second operand has 19 states, 16 states have (on average 6.0) internal successors, (96), 18 states have internal predecessors, (96), 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-28 02:31:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:31:33,711 INFO L93 Difference]: Finished difference Result 1387 states and 1819 transitions. [2024-11-28 02:31:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:31:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.0) internal successors, (96), 18 states have internal predecessors, (96), 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 122 [2024-11-28 02:31:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:31:33,729 INFO L225 Difference]: With dead ends: 1387 [2024-11-28 02:31:33,729 INFO L226 Difference]: Without dead ends: 1387 [2024-11-28 02:31:33,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=425, Unknown=6, NotChecked=282, Total=812 [2024-11-28 02:31:33,730 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 656 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 3211 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:31:33,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 3574 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3211 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-28 02:31:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-28 02:31:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1385. [2024-11-28 02:31:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1096 states have (on average 1.6094890510948905) internal successors, (1764), 1375 states have internal predecessors, (1764), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:31:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1817 transitions. [2024-11-28 02:31:33,767 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1817 transitions. Word has length 122 [2024-11-28 02:31:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:31:33,768 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1817 transitions. [2024-11-28 02:31:33,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.0) internal successors, (96), 18 states have internal predecessors, (96), 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-28 02:31:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1817 transitions. [2024-11-28 02:31:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-28 02:31:33,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:31:33,773 INFO L218 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] [2024-11-28 02:31:33,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-28 02:31:33,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-28 02:31:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:31:34,174 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:31:34,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:31:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1805218045, now seen corresponding path program 1 times [2024-11-28 02:31:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:31:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451721307] [2024-11-28 02:31:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:31:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:31:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:31:34,177 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:31:34,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-28 02:31:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:31:34,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-28 02:31:34,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:31:34,701 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-28 02:31:34,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:31:34,889 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:31:34,890 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-28 02:31:34,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:31:34,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:31:35,060 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-28 02:31:35,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:31:36,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:31:36,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:31:36,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:31:36,187 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:31:36,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:31:36,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:31:36,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:31:36,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:31:36,277 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-28 02:31:36,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:31:36,538 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-28 02:31:38,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2731 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2732))) (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$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2731) .cse0 v_ArrVal_2640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2731 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2731) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 02:31:38,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:31:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451721307] [2024-11-28 02:31:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451721307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:31:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [878681629] [2024-11-28 02:31:38,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:31:38,022 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:31:38,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:31:38,024 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:31:38,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-28 02:33:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:24,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-28 02:33:24,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:24,550 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-28 02:33:24,703 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:33:24,703 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-28 02:33:24,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:33:24,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:33:24,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:33:24,825 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-28 02:33:24,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:33:25,826 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:25,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 62 treesize of output 57 [2024-11-28 02:33:25,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:33:25,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:25,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:33:25,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:33:26,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:33:26,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:33:26,028 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-28 02:33:26,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:28,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3249 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3248))) (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$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3249) .cse0 v_ArrVal_2640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3249 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3249) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 02:33:28,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [878681629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:28,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:33:28,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-28 02:33:28,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518199301] [2024-11-28 02:33:28,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:33:28,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:33:28,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:33:28,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:33:28,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=9, NotChecked=72, Total=240 [2024-11-28 02:33:28,152 INFO L87 Difference]: Start difference. First operand 1385 states and 1817 transitions. Second operand has 10 states, 8 states have (on average 9.75) internal successors, (78), 10 states have internal predecessors, (78), 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-28 02:33:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:33:38,613 INFO L93 Difference]: Finished difference Result 1384 states and 1815 transitions. [2024-11-28 02:33:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:33:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.75) internal successors, (78), 10 states have internal predecessors, (78), 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 122 [2024-11-28 02:33:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:33:38,618 INFO L225 Difference]: With dead ends: 1384 [2024-11-28 02:33:38,618 INFO L226 Difference]: Without dead ends: 1384 [2024-11-28 02:33:38,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 238 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=239, Unknown=10, NotChecked=102, Total=420 [2024-11-28 02:33:38,620 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 650 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:33:38,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 2321 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2024-11-28 02:33:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-28 02:33:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2024-11-28 02:33:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1096 states have (on average 1.6076642335766422) internal successors, (1762), 1374 states have internal predecessors, (1762), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:33:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1815 transitions. [2024-11-28 02:33:38,638 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1815 transitions. Word has length 122 [2024-11-28 02:33:38,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:33:38,639 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1815 transitions. [2024-11-28 02:33:38,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.75) internal successors, (78), 10 states have internal predecessors, (78), 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-28 02:33:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1815 transitions. [2024-11-28 02:33:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 02:33:38,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:33:38,640 INFO L218 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, 1] [2024-11-28 02:33:38,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-28 02:33:38,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-28 02:33:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:39,041 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:33:39,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:33:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1964963473, now seen corresponding path program 1 times [2024-11-28 02:33:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:33:39,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011494037] [2024-11-28 02:33:39,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:33:39,045 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:33:39,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-28 02:33:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:39,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 02:33:39,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:39,879 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:33:39,879 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-28 02:33:39,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:33:40,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:40,611 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-28 02:33:40,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:40,738 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-28 02:33:40,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:40,829 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-28 02:33:40,848 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-28 02:33:40,876 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-28 02:33:40,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:40,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3632 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:33:41,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3631 (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$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3631))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3632)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:33:41,027 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3631 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3631))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3632)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:33:41,614 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-28 02:33:41,614 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-28 02:33:41,632 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3678))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3631)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3632)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-28 02:33:41,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:33:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011494037] [2024-11-28 02:33:41,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011494037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1265134534] [2024-11-28 02:33:41,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:41,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:33:41,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:33:41,640 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:33:41,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-28 02:33:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:57,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 02:33:57,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:57,294 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-28 02:33:57,458 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 02:33:57,458 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 27 [2024-11-28 02:33:57,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:33:57,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 02:33:58,940 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:58,941 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-28 02:33:59,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:59,146 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-28 02:33:59,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:59,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 02:33:59,327 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-28 02:33:59,398 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-28 02:33:59,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:59,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3632 (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$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3632)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:33:59,504 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3632 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3632)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:34:00,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3632 (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$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4109))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4062)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3632)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:34:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1265134534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:34:00,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:34:00,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-11-28 02:34:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163481423] [2024-11-28 02:34:00,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:34:00,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:34:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:34:00,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:34:00,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=420, Unknown=17, NotChecked=336, Total=870 [2024-11-28 02:34:00,030 INFO L87 Difference]: Start difference. First operand 1384 states and 1815 transitions. Second operand has 21 states, 18 states have (on average 5.888888888888889) internal successors, (106), 20 states have internal predecessors, (106), 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-28 02:34:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:34:07,857 INFO L93 Difference]: Finished difference Result 1385 states and 1815 transitions. [2024-11-28 02:34:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:34:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.888888888888889) internal successors, (106), 20 states have internal predecessors, (106), 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 125 [2024-11-28 02:34:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:34:07,861 INFO L225 Difference]: With dead ends: 1385 [2024-11-28 02:34:07,861 INFO L226 Difference]: Without dead ends: 1385 [2024-11-28 02:34:07,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=543, Unknown=17, NotChecked=378, Total=1056 [2024-11-28 02:34:07,862 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 649 mSDsluCounter, 3163 mSDsCounter, 0 mSdLazyCounter, 3172 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:34:07,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 3575 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3172 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-28 02:34:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-28 02:34:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1383. [2024-11-28 02:34:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1096 states have (on average 1.6058394160583942) internal successors, (1760), 1373 states have internal predecessors, (1760), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:34:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1813 transitions. [2024-11-28 02:34:07,883 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1813 transitions. Word has length 125 [2024-11-28 02:34:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:34:07,883 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1813 transitions. [2024-11-28 02:34:07,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.888888888888889) internal successors, (106), 20 states have internal predecessors, (106), 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-28 02:34:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1813 transitions. [2024-11-28 02:34:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 02:34:07,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:34:07,885 INFO L218 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, 1] [2024-11-28 02:34:07,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-28 02:34:08,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-28 02:34:08,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:34:08,286 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:34:08,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:34:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1964963472, now seen corresponding path program 1 times [2024-11-28 02:34:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:34:08,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501618053] [2024-11-28 02:34:08,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:34:08,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:34:08,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:34:08,289 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:34:08,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-28 02:34:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:34:08,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-28 02:34:08,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:34:09,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:34:09,119 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:34:09,119 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-28 02:34:09,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:34:09,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-28 02:34:09,329 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-28 02:34:09,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:34:10,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:10,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:34:10,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:34:10,386 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:10,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:34:10,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:34:10,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:10,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:34:10,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:34:10,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:34:10,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:34:10,601 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-28 02:34:10,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:34:10,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:34:10,813 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-28 02:34:10,906 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4539) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4538))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4539) .cse2 v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:34:11,031 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4539) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4538))) (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$#2.offset| .cse1 v_ArrVal_4539) .cse3 v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 02:34:12,941 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4632))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4633) .cse1 v_ArrVal_4539) (select (select (store .cse2 .cse1 v_ArrVal_4538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4540))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4632))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4538))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4633) .cse4 v_ArrVal_4539) .cse5 v_ArrVal_4540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 02:34:12,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:34:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501618053] [2024-11-28 02:34:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501618053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:34:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1507850855] [2024-11-28 02:34:12,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:34:12,956 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:34:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:34:12,959 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:34:12,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-28 02:34:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:34:28,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-28 02:34:28,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:34:29,003 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-28 02:34:29,325 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:34:29,325 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-28 02:34:29,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:34:29,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:34:29,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:34:29,556 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-28 02:34:29,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:34:31,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:31,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:34:31,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:34:31,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:31,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:34:31,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:34:31,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:34:31,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:34:31,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:34:31,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:34:31,442 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-28 02:34:31,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:34:31,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:34:31,568 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_5065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 02:34:31,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5064) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5063))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5064) .cse2 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:34:31,835 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_5063))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_5064) .cse1 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_5064) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_5063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-28 02:34:34,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5158))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5063))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5157) .cse0 v_ArrVal_5064) .cse1 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5158))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5157) .cse6 v_ArrVal_5064) (select (select (store .cse7 .cse6 v_ArrVal_5063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5066))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-28 02:34:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1507850855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:34:34,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:34:34,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-28 02:34:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887716734] [2024-11-28 02:34:34,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:34:34,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:34:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:34:34,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:34:34,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=134, Unknown=10, NotChecked=310, Total=506 [2024-11-28 02:34:34,471 INFO L87 Difference]: Start difference. First operand 1383 states and 1813 transitions. Second operand has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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-28 02:34:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:34:52,509 INFO L93 Difference]: Finished difference Result 1382 states and 1811 transitions. [2024-11-28 02:34:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:34:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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 125 [2024-11-28 02:34:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:34:52,512 INFO L225 Difference]: With dead ends: 1382 [2024-11-28 02:34:52,513 INFO L226 Difference]: Without dead ends: 1382 [2024-11-28 02:34:52,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=90, Invalid=282, Unknown=10, NotChecked=430, Total=812 [2024-11-28 02:34:52,513 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 648 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 3195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:34:52,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 2056 Invalid, 3201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3195 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2024-11-28 02:34:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-28 02:34:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2024-11-28 02:34:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1096 states have (on average 1.604014598540146) internal successors, (1758), 1372 states have internal predecessors, (1758), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:34:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1811 transitions. [2024-11-28 02:34:52,536 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1811 transitions. Word has length 125 [2024-11-28 02:34:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:34:52,537 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1811 transitions. [2024-11-28 02:34:52,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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-28 02:34:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1811 transitions. [2024-11-28 02:34:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 02:34:52,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:34:52,539 INFO L218 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, 1, 1, 1, 1] [2024-11-28 02:34:52,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-28 02:34:52,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-28 02:34:52,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:34:52,940 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:34:52,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:34:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2117208311, now seen corresponding path program 1 times [2024-11-28 02:34:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:34:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578345738] [2024-11-28 02:34:52,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:34:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:34:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:34:52,943 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:34:52,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-28 02:34:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:34:53,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-28 02:34:53,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:34:54,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:34:54,200 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-28 02:34:54,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:34:55,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:55,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 44 treesize of output 43 [2024-11-28 02:34:56,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:56,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 44 treesize of output 43 [2024-11-28 02:34:56,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:56,265 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-28 02:34:56,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:34:56,510 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-28 02:34:56,557 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-28 02:34:56,647 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-28 02:34:56,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:34:56,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5548 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2024-11-28 02:34:56,979 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (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$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:34:57,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:34:57,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (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$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5546))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5547)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:34:57,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (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 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5546))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5547)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 02:34:57,995 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-28 02:34:57,995 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-28 02:34:58,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5594 (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 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5594))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5546)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5547)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-28 02:34:58,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:34:58,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578345738] [2024-11-28 02:34:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578345738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:34:58,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [8897963] [2024-11-28 02:34:58,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:34:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:34:58,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:34:58,048 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:34:58,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-28 02:35:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:35:19,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 02:35:19,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:35:19,064 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-28 02:35:19,669 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 02:35:19,669 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 27 [2024-11-28 02:35:19,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:35:20,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 02:35:22,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:22,908 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-28 02:35:23,349 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:23,349 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-28 02:35:23,670 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:23,670 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-28 02:35:23,990 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:23,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 44 treesize of output 43 [2024-11-28 02:35:24,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 33 treesize of output 15 [2024-11-28 02:35:24,269 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-28 02:35:24,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:35:24,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5985 (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$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5985))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:35:24,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5985 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5985))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:35:24,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5985 (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$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5984))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5985)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:35:24,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5985 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5984))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5985)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:35:25,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5985 (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$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6032))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5984)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5985)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:35:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [8897963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:35:25,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:35:25,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-28 02:35:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395158191] [2024-11-28 02:35:25,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:35:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:35:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:35:25,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:35:25,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=506, Unknown=20, NotChecked=616, Total=1260 [2024-11-28 02:35:25,407 INFO L87 Difference]: Start difference. First operand 1382 states and 1811 transitions. Second operand has 23 states, 20 states have (on average 5.6) internal successors, (112), 22 states have internal predecessors, (112), 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-28 02:35:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:35:51,012 INFO L93 Difference]: Finished difference Result 1383 states and 1811 transitions. [2024-11-28 02:35:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:35:51,013 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.6) internal successors, (112), 22 states have internal predecessors, (112), 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 128 [2024-11-28 02:35:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:35:51,015 INFO L225 Difference]: With dead ends: 1383 [2024-11-28 02:35:51,016 INFO L226 Difference]: Without dead ends: 1383 [2024-11-28 02:35:51,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=139, Invalid=641, Unknown=20, NotChecked=682, Total=1482 [2024-11-28 02:35:51,016 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 640 mSDsluCounter, 5078 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 5489 SdHoareTripleChecker+Invalid, 4938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:35:51,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 5489 Invalid, 4938 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 4925 Invalid, 0 Unknown, 0 Unchecked, 25.2s Time] [2024-11-28 02:35:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-28 02:35:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2024-11-28 02:35:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1096 states have (on average 1.602189781021898) internal successors, (1756), 1371 states have internal predecessors, (1756), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 9 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 02:35:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1809 transitions. [2024-11-28 02:35:51,031 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1809 transitions. Word has length 128 [2024-11-28 02:35:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:35:51,031 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1809 transitions. [2024-11-28 02:35:51,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.6) internal successors, (112), 22 states have internal predecessors, (112), 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-28 02:35:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1809 transitions. [2024-11-28 02:35:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 02:35:51,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:35:51,033 INFO L218 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, 1, 1, 1, 1] [2024-11-28 02:35:51,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-28 02:35:51,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2024-11-28 02:35:51,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:35:51,434 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:35:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:35:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2117208310, now seen corresponding path program 1 times [2024-11-28 02:35:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:35:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955762493] [2024-11-28 02:35:51,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:35:51,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:35:51,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:35:51,437 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:35:51,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-28 02:35:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:35:52,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-28 02:35:52,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:35:52,710 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:35:52,710 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-28 02:35:52,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:35:52,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:35:52,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:35:53,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:35:53,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:35:55,111 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:55,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:35:55,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:35:55,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:55,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:35:55,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:35:55,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:55,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 62 treesize of output 57 [2024-11-28 02:35:55,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:35:55,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:35:55,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:35:56,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:35:56,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:35:56,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:35:56,183 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-28 02:35:56,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:35:56,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-28 02:35:56,572 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 02:35:56,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6470) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6469))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6470) .cse2 v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:35:56,822 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6470) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6469))) (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$#2.offset| .cse1 v_ArrVal_6470) .cse3 v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 02:35:56,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6468))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6469))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6467) .cse0 v_ArrVal_6470) .cse1 v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6468))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6467) .cse6 v_ArrVal_6470) (select (select (store .cse7 .cse6 v_ArrVal_6469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6472))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-28 02:35:57,096 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6468))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6467) .cse2 v_ArrVal_6470) (select (select (store .cse3 .cse2 v_ArrVal_6469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6472))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6468))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_6469))) (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$#2.offset| .cse1 v_ArrVal_6467) .cse5 v_ArrVal_6470) .cse6 v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-28 02:35:59,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6564))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_6468))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6563) .cse1 v_ArrVal_6467) .cse2 v_ArrVal_6470) (select (select (store .cse3 .cse2 v_ArrVal_6469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6472))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6564))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_6468))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_6469))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6563) .cse6 v_ArrVal_6467) .cse7 v_ArrVal_6470) .cse8 v_ArrVal_6472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-28 02:35:59,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:35:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955762493] [2024-11-28 02:35:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955762493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:35:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [843544570] [2024-11-28 02:35:59,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:35:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:35:59,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:35:59,426 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:35:59,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ff7887-3149-4c15-83ad-f00916994b14/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-28 02:36:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:36:19,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-28 02:36:19,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:36:19,768 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-28 02:36:20,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:36:20,279 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:36:20,279 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-28 02:36:20,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:36:20,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:36:20,490 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-28 02:36:20,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:36:22,613 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:36:22,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:36:22,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:36:22,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:36:22,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 62 treesize of output 57 [2024-11-28 02:36:22,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:36:23,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:36:23,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:36:23,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:36:23,276 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:36:23,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:36:23,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:36:23,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:36:23,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:36:23,390 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-28 02:36:23,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:36:23,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2024-11-28 02:36:23,567 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 02:36:23,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7002))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7003) .cse0 v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7003) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-28 02:36:23,803 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_7002))) (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$#2.offset| .cse0 v_ArrVal_7003) .cse1 v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_7003) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_7002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-28 02:36:28,367 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7000))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7001) .cse2 v_ArrVal_7003) (select (select (store .cse3 .cse2 v_ArrVal_7002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7005))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7000))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_7002))) (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$#2.offset| .cse1 v_ArrVal_7001) .cse5 v_ArrVal_7003) .cse6 v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_7004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-28 02:36:34,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7096))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_7000))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7002))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7097) .cse0 v_ArrVal_7001) .cse1 v_ArrVal_7003) .cse2 v_ArrVal_7005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7096))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_7000))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7097) .cse8 v_ArrVal_7001) .cse9 v_ArrVal_7003) (select (select (store .cse10 .cse9 v_ArrVal_7002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7005))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-28 02:36:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [843544570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:36:34,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:36:34,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-28 02:36:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100814594] [2024-11-28 02:36:34,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:36:34,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:36:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:36:34,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:36:34,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=177, Unknown=20, NotChecked=494, Total=756 [2024-11-28 02:36:34,880 INFO L87 Difference]: Start difference. First operand 1381 states and 1809 transitions. Second operand has 12 states, 10 states have (on average 8.8) internal successors, (88), 12 states have internal predecessors, (88), 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)