./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya --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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:37:48,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:37:48,856 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:37:48,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:37:48,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:37:48,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:37:48,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:37:48,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:37:48,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:37:48,885 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:37:48,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:37:48,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:37:48,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:37:48,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:37:48,888 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:37:48,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:37:48,889 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:37:48,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:37:48,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:37:48,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:37:48,891 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:37:48,891 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:37:48,892 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:37:48,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:37:48,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:37:48,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:37:48,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:37:48,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:37:48,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:37:48,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:37:48,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:37:48,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:37:48,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:37:48,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:37:48,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:37:48,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:37:48,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:37:48,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:37:48,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:37:48,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:37:48,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:37:48,904 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-11-29 04:37:49,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:37:49,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:37:49,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:37:49,132 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:37:49,132 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:37:49,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-29 04:37:51,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:37:52,066 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:37:52,066 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-29 04:37:52,079 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data/f4a66f204/c0edf507f2994da594ed74b4b3a38926/FLAG844a47a5d [2023-11-29 04:37:52,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data/f4a66f204/c0edf507f2994da594ed74b4b3a38926 [2023-11-29 04:37:52,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:37:52,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:37:52,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:37:52,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:37:52,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:37:52,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10055653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52, skipping insertion in model container [2023-11-29 04:37:52,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,465 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:37:52,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:37:52,704 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:37:52,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:37:52,773 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:37:52,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52 WrapperNode [2023-11-29 04:37:52,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:37:52,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:37:52,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:37:52,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:37:52,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,819 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-29 04:37:52,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:37:52,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:37:52,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:37:52,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:37:52,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,853 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-11-29 04:37:52,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:37:52,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:37:52,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:37:52,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:37:52,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (1/1) ... [2023-11-29 04:37:52,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:37:52,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:52,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:52,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:37:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 04:37:52,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 04:37:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:37:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:37:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:37:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:37:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:37:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:37:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:37:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:37:53,050 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:37:53,052 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:37:53,394 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:37:53,436 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:37:53,437 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-29 04:37:53,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:37:53 BoogieIcfgContainer [2023-11-29 04:37:53,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:37:53,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:37:53,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:37:53,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:37:53,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:37:52" (1/3) ... [2023-11-29 04:37:53,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536842d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:37:53, skipping insertion in model container [2023-11-29 04:37:53,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:52" (2/3) ... [2023-11-29 04:37:53,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536842d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:37:53, skipping insertion in model container [2023-11-29 04:37:53,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:37:53" (3/3) ... [2023-11-29 04:37:53,447 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-11-29 04:37:53,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:37:53,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-29 04:37:53,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:37:53,516 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3c13c0ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:37:53,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-29 04:37:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:37:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:37:53,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:53,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:37:53,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:53,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 9685, now seen corresponding path program 1 times [2023-11-29 04:37:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:53,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462081845] [2023-11-29 04:37:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462081845] [2023-11-29 04:37:53,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462081845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:53,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:37:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026972311] [2023-11-29 04:37:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:53,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:37:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:53,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:37:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:37:53,764 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:53,911 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-11-29 04:37:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:37:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 04:37:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:53,921 INFO L225 Difference]: With dead ends: 136 [2023-11-29 04:37:53,922 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 04:37:53,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:37:53,926 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:53,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 04:37:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2023-11-29 04:37:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-11-29 04:37:53,961 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2023-11-29 04:37:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:53,961 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-11-29 04:37:53,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-11-29 04:37:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:37:53,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:53,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:37:53,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:37:53,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:53,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 9686, now seen corresponding path program 1 times [2023-11-29 04:37:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:53,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267893331] [2023-11-29 04:37:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267893331] [2023-11-29 04:37:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267893331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:54,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:37:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835972908] [2023-11-29 04:37:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:54,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:37:54,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:54,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:37:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:37:54,054 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:54,165 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2023-11-29 04:37:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:37:54,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 04:37:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:54,167 INFO L225 Difference]: With dead ends: 140 [2023-11-29 04:37:54,167 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 04:37:54,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:37:54,169 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:54,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 96 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 04:37:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2023-11-29 04:37:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2023-11-29 04:37:54,181 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2023-11-29 04:37:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:54,181 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2023-11-29 04:37:54,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2023-11-29 04:37:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:37:54,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:54,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:54,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:37:54,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:54,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866331, now seen corresponding path program 1 times [2023-11-29 04:37:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042566437] [2023-11-29 04:37:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:54,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:54,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042566437] [2023-11-29 04:37:54,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042566437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:54,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:54,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:37:54,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278369311] [2023-11-29 04:37:54,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:54,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:37:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:54,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:37:54,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:37:54,277 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:54,452 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-29 04:37:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:37:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:37:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:54,453 INFO L225 Difference]: With dead ends: 116 [2023-11-29 04:37:54,454 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 04:37:54,454 INFO L412 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 [2023-11-29 04:37:54,455 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:54,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:37:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 04:37:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2023-11-29 04:37:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-29 04:37:54,464 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2023-11-29 04:37:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:54,464 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-29 04:37:54,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-29 04:37:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:37:54,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:54,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:54,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:37:54,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:54,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866330, now seen corresponding path program 1 times [2023-11-29 04:37:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162981278] [2023-11-29 04:37:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162981278] [2023-11-29 04:37:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162981278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:37:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239617842] [2023-11-29 04:37:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:54,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:37:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:37:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:37:54,620 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:54,832 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2023-11-29 04:37:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:37:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:37:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:54,834 INFO L225 Difference]: With dead ends: 178 [2023-11-29 04:37:54,834 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 04:37:54,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:37:54,835 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 185 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:54,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 97 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:37:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 04:37:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 131. [2023-11-29 04:37:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.6666666666666667) internal successors, (145), 129 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2023-11-29 04:37:54,846 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 7 [2023-11-29 04:37:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:54,846 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2023-11-29 04:37:54,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2023-11-29 04:37:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:37:54,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:54,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:54,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:37:54,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:54,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222096, now seen corresponding path program 1 times [2023-11-29 04:37:54,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:54,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407486300] [2023-11-29 04:37:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:54,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407486300] [2023-11-29 04:37:54,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407486300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:37:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120063296] [2023-11-29 04:37:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:54,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:37:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:37:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:37:54,974 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:37:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:55,108 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2023-11-29 04:37:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:37:55,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2023-11-29 04:37:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:55,110 INFO L225 Difference]: With dead ends: 130 [2023-11-29 04:37:55,110 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 04:37:55,110 INFO L412 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 [2023-11-29 04:37:55,111 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:55,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 04:37:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-29 04:37:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 128 states have internal predecessors, (143), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2023-11-29 04:37:55,120 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 9 [2023-11-29 04:37:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:55,120 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2023-11-29 04:37:55,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:37:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2023-11-29 04:37:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:37:55,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:55,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:55,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:37:55,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:55,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222095, now seen corresponding path program 1 times [2023-11-29 04:37:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302427215] [2023-11-29 04:37:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:55,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302427215] [2023-11-29 04:37:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302427215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:55,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:55,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:37:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253641211] [2023-11-29 04:37:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:55,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:37:55,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:55,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:37:55,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:37:55,316 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:37:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:55,474 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-11-29 04:37:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:37:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2023-11-29 04:37:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:55,477 INFO L225 Difference]: With dead ends: 129 [2023-11-29 04:37:55,477 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 04:37:55,477 INFO L412 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 [2023-11-29 04:37:55,478 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:55,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 04:37:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-29 04:37:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 127 states have internal predecessors, (141), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2023-11-29 04:37:55,485 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 9 [2023-11-29 04:37:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:55,485 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2023-11-29 04:37:55,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:37:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2023-11-29 04:37:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 04:37:55,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:55,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:55,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:37:55,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:55,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:55,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224648, now seen corresponding path program 1 times [2023-11-29 04:37:55,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:55,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298454436] [2023-11-29 04:37:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:55,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:55,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:55,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298454436] [2023-11-29 04:37:55,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298454436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:55,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:37:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922588617] [2023-11-29 04:37:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:55,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:37:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:37:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:37:55,589 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:55,717 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2023-11-29 04:37:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:37:55,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 04:37:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:55,719 INFO L225 Difference]: With dead ends: 128 [2023-11-29 04:37:55,719 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 04:37:55,719 INFO L412 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 [2023-11-29 04:37:55,720 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:55,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 04:37:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-29 04:37:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.5977011494252873) internal successors, (139), 126 states have internal predecessors, (139), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2023-11-29 04:37:55,726 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 10 [2023-11-29 04:37:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:55,727 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2023-11-29 04:37:55,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2023-11-29 04:37:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 04:37:55,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:55,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:55,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:37:55,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:55,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224649, now seen corresponding path program 1 times [2023-11-29 04:37:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356179008] [2023-11-29 04:37:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356179008] [2023-11-29 04:37:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356179008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:55,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:37:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119529226] [2023-11-29 04:37:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:55,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:37:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:55,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:37:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:37:55,894 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:56,046 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2023-11-29 04:37:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:37:56,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 04:37:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:56,047 INFO L225 Difference]: With dead ends: 127 [2023-11-29 04:37:56,047 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 04:37:56,047 INFO L412 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 [2023-11-29 04:37:56,048 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:56,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 04:37:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-29 04:37:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 125 states have internal predecessors, (137), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2023-11-29 04:37:56,054 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 10 [2023-11-29 04:37:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:56,054 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2023-11-29 04:37:56,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2023-11-29 04:37:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:37:56,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:56,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:56,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:37:56,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:56,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 327030838, now seen corresponding path program 1 times [2023-11-29 04:37:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480649342] [2023-11-29 04:37:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:56,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480649342] [2023-11-29 04:37:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480649342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:56,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:56,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:37:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413252260] [2023-11-29 04:37:56,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:56,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:37:56,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:56,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:37:56,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:37:56,256 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:56,528 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2023-11-29 04:37:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:37:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:37:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:56,532 INFO L225 Difference]: With dead ends: 130 [2023-11-29 04:37:56,532 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 04:37:56,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:37:56,533 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 151 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:56,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 152 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:37:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 04:37:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2023-11-29 04:37:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 124 states have internal predecessors, (136), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2023-11-29 04:37:56,538 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 11 [2023-11-29 04:37:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:56,538 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2023-11-29 04:37:56,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2023-11-29 04:37:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:37:56,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:56,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:56,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:37:56,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:56,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 327030839, now seen corresponding path program 1 times [2023-11-29 04:37:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511094298] [2023-11-29 04:37:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511094298] [2023-11-29 04:37:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511094298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:56,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:37:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837125813] [2023-11-29 04:37:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:56,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:37:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:37:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:37:56,825 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:57,254 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-11-29 04:37:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:37:57,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:37:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:57,256 INFO L225 Difference]: With dead ends: 125 [2023-11-29 04:37:57,256 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 04:37:57,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:37:57,257 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 144 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:57,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:37:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 04:37:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-11-29 04:37:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 105 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2023-11-29 04:37:57,261 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 11 [2023-11-29 04:37:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:57,262 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2023-11-29 04:37:57,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2023-11-29 04:37:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:37:57,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:57,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:57,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:37:57,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:57,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 164325843, now seen corresponding path program 1 times [2023-11-29 04:37:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761039849] [2023-11-29 04:37:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:57,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:57,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761039849] [2023-11-29 04:37:57,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761039849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:57,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:57,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:37:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701910568] [2023-11-29 04:37:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:57,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:37:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:57,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:37:57,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:37:57,433 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:57,563 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2023-11-29 04:37:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:37:57,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 04:37:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:57,565 INFO L225 Difference]: With dead ends: 106 [2023-11-29 04:37:57,565 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 04:37:57,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:37:57,566 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:57,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 04:37:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-29 04:37:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.513157894736842) internal successors, (115), 104 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-11-29 04:37:57,569 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 12 [2023-11-29 04:37:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:57,569 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-11-29 04:37:57,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-11-29 04:37:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:37:57,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:57,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:57,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:37:57,571 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:57,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash 164325844, now seen corresponding path program 1 times [2023-11-29 04:37:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:57,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823966987] [2023-11-29 04:37:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:57,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:57,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:57,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823966987] [2023-11-29 04:37:57,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823966987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:57,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:37:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447972521] [2023-11-29 04:37:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:57,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:37:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:57,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:37:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:37:57,776 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:57,943 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2023-11-29 04:37:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:37:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 04:37:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:57,944 INFO L225 Difference]: With dead ends: 105 [2023-11-29 04:37:57,944 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 04:37:57,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:37:57,945 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:57,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 04:37:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-29 04:37:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.5) internal successors, (114), 103 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2023-11-29 04:37:57,949 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 12 [2023-11-29 04:37:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:57,949 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2023-11-29 04:37:57,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2023-11-29 04:37:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:37:57,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:57,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:37:57,951 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:57,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2042218147, now seen corresponding path program 1 times [2023-11-29 04:37:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096707015] [2023-11-29 04:37:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:58,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096707015] [2023-11-29 04:37:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096707015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:37:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952326378] [2023-11-29 04:37:58,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:58,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:37:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:37:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:37:58,101 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:58,458 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-11-29 04:37:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:37:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 04:37:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:58,461 INFO L225 Difference]: With dead ends: 120 [2023-11-29 04:37:58,461 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 04:37:58,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:37:58,462 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 136 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:58,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 242 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:37:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 04:37:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-11-29 04:37:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.486842105263158) internal successors, (113), 102 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-29 04:37:58,466 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 15 [2023-11-29 04:37:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:58,466 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-29 04:37:58,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-29 04:37:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 04:37:58,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:58,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:58,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:37:58,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:58,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 174750842, now seen corresponding path program 1 times [2023-11-29 04:37:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:58,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320496622] [2023-11-29 04:37:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:58,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:58,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320496622] [2023-11-29 04:37:58,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320496622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:58,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:58,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:37:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068380945] [2023-11-29 04:37:58,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:58,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:37:58,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:37:58,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:37:58,518 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:58,619 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2023-11-29 04:37:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:37:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 04:37:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:58,621 INFO L225 Difference]: With dead ends: 154 [2023-11-29 04:37:58,621 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 04:37:58,621 INFO L412 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 [2023-11-29 04:37:58,622 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 148 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:58,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 04:37:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2023-11-29 04:37:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 101 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2023-11-29 04:37:58,626 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 16 [2023-11-29 04:37:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:58,626 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2023-11-29 04:37:58,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2023-11-29 04:37:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:37:58,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:58,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:58,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:37:58,628 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:58,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash -622081400, now seen corresponding path program 1 times [2023-11-29 04:37:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:58,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346940818] [2023-11-29 04:37:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346940818] [2023-11-29 04:37:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346940818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:37:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115807910] [2023-11-29 04:37:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:58,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:37:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:37:58,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:37:58,687 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:58,793 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-11-29 04:37:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:37:58,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 04:37:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:58,794 INFO L225 Difference]: With dead ends: 102 [2023-11-29 04:37:58,794 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 04:37:58,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:37:58,795 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:58,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 195 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:37:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 04:37:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 04:37:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 100 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-11-29 04:37:58,799 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 21 [2023-11-29 04:37:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:58,799 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-11-29 04:37:58,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-11-29 04:37:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:37:58,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:58,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:58,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:37:58,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:58,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -590564444, now seen corresponding path program 1 times [2023-11-29 04:37:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184036324] [2023-11-29 04:37:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:59,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184036324] [2023-11-29 04:37:59,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184036324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:59,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:59,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:37:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480201247] [2023-11-29 04:37:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:59,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:37:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:37:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:37:59,376 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:59,769 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2023-11-29 04:37:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:37:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 04:37:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:37:59,770 INFO L225 Difference]: With dead ends: 133 [2023-11-29 04:37:59,771 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 04:37:59,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:37:59,772 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:37:59,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 305 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:37:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 04:37:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2023-11-29 04:37:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 112 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2023-11-29 04:37:59,776 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 21 [2023-11-29 04:37:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:37:59,776 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2023-11-29 04:37:59,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2023-11-29 04:37:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:37:59,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:37:59,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:37:59,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:37:59,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -622050630, now seen corresponding path program 1 times [2023-11-29 04:37:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369323437] [2023-11-29 04:37:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369323437] [2023-11-29 04:38:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369323437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:38:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:38:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:38:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215298043] [2023-11-29 04:38:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:38:00,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:38:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:00,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:38:00,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:38:00,100 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2023-11-29 04:38:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:00,373 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2023-11-29 04:38:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:38:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 [2023-11-29 04:38:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:38:00,375 INFO L225 Difference]: With dead ends: 135 [2023-11-29 04:38:00,375 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 04:38:00,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:38:00,376 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 134 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:38:00,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 161 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:38:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 04:38:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2023-11-29 04:38:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-11-29 04:38:00,380 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 21 [2023-11-29 04:38:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:38:00,380 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-11-29 04:38:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2023-11-29 04:38:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-11-29 04:38:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:38:00,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:38:00,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:00,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:38:00,382 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:38:00,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash -622050629, now seen corresponding path program 1 times [2023-11-29 04:38:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:00,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054541883] [2023-11-29 04:38:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:00,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054541883] [2023-11-29 04:38:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054541883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:38:00,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:38:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:38:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093134066] [2023-11-29 04:38:00,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:38:00,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:38:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:38:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:38:00,747 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2023-11-29 04:38:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:01,012 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2023-11-29 04:38:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:38:01,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 [2023-11-29 04:38:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:38:01,013 INFO L225 Difference]: With dead ends: 138 [2023-11-29 04:38:01,013 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 04:38:01,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:38:01,014 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 48 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:38:01,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 240 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:38:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 04:38:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2023-11-29 04:38:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-29 04:38:01,018 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 21 [2023-11-29 04:38:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:38:01,019 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-29 04:38:01,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2023-11-29 04:38:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-29 04:38:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:38:01,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:38:01,020 INFO L195 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] [2023-11-29 04:38:01,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:38:01,020 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:38:01,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:01,021 INFO L85 PathProgramCache]: Analyzing trace with hash 830531664, now seen corresponding path program 1 times [2023-11-29 04:38:01,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:01,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115410603] [2023-11-29 04:38:01,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115410603] [2023-11-29 04:38:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115410603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:38:01,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:38:01,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:38:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291829731] [2023-11-29 04:38:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:38:01,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:38:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:38:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:38:01,569 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:01,841 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2023-11-29 04:38:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:38:01,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 04:38:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:38:01,842 INFO L225 Difference]: With dead ends: 137 [2023-11-29 04:38:01,842 INFO L226 Difference]: Without dead ends: 137 [2023-11-29 04:38:01,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:38:01,843 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 167 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:38:01,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 294 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:38:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-29 04:38:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2023-11-29 04:38:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-29 04:38:01,847 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 25 [2023-11-29 04:38:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:38:01,848 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-29 04:38:01,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-29 04:38:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:38:01,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:38:01,849 INFO L195 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] [2023-11-29 04:38:01,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:38:01,850 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:38:01,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash 228498532, now seen corresponding path program 1 times [2023-11-29 04:38:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582340289] [2023-11-29 04:38:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582340289] [2023-11-29 04:38:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582340289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:38:01,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:38:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:38:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407406545] [2023-11-29 04:38:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:38:01,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:38:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:38:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:38:01,940 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:02,052 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-11-29 04:38:02,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:38:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 04:38:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:38:02,055 INFO L225 Difference]: With dead ends: 131 [2023-11-29 04:38:02,055 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 04:38:02,055 INFO L412 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 [2023-11-29 04:38:02,056 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:38:02,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 81 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:38:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 04:38:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-11-29 04:38:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 120 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-11-29 04:38:02,060 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 29 [2023-11-29 04:38:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:38:02,060 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-11-29 04:38:02,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-11-29 04:38:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:38:02,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:38:02,061 INFO L195 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] [2023-11-29 04:38:02,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:38:02,062 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:38:02,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1022216661, now seen corresponding path program 1 times [2023-11-29 04:38:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160998733] [2023-11-29 04:38:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160998733] [2023-11-29 04:38:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160998733] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:38:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066603236] [2023-11-29 04:38:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:02,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:38:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:02,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:38:02,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:38:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:03,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 04:38:03,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:03,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:38:03,205 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 [2023-11-29 04:38:03,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:38:03,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 04:38:03,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:38:03,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:38:03,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:38:03,369 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:38:03,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 04:38:03,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:38:03,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 04:38:03,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:38:03,505 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 04:38:03,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 04:38:03,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:38:03,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:38:03,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:38:03,637 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:38:03,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 04:38:03,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:38:03,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:38:03,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:38:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:03,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:03,779 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-29 04:38:03,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:38:03,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-11-29 04:38:03,890 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 60 treesize of output 52 [2023-11-29 04:38:03,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 04:38:04,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:38:04,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 137 [2023-11-29 04:38:04,875 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 257 treesize of output 233 [2023-11-29 04:38:04,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 213 [2023-11-29 04:38:05,041 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-11-29 04:38:05,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 330 [2023-11-29 04:38:05,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2023-11-29 04:38:29,826 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_825 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse46 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse46 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse46 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse17 (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse29 (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int))) (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (let ((.cse44 (store .cse45 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse44 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse44 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse45 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse31 (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse43 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse43 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse43 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (.cse19 (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse42 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (let ((.cse41 (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse41 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= (select (select (store (store .cse41 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse20 (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse40 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse40 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))))) (.cse6 (not .cse0))) (and (or .cse0 (and .cse1 (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822))) (or (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) .cse6) (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))))) (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= v_prenex_20 v_arrayElimCell_27))))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse0) (or (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_prenex_20 v_arrayElimCell_27))) .cse6) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse0) (or .cse0 (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse12 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= v_prenex_20 v_arrayElimCell_27))))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))))))) (or (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) .cse6) (or .cse0 (and (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))))))) .cse17)) (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_prenex_20 v_arrayElimCell_27)))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or .cse0 (and .cse19 .cse1 .cse20)) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) .cse6) (or (and (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse17) .cse0) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse6) (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))))))) (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse25 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store (store .cse25 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))))) (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse0 (and .cse29 (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse31)) (or (and (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse31 (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse33 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse0) (or .cse6 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_prenex_20 v_arrayElimCell_27)))) (or .cse0 (and .cse29 (forall ((v_ArrVal_814 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse31)) (or (and .cse19 .cse20 (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse36 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse36 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) .cse0) (or (forall ((v_ArrVal_814 (Array Int Int)) (v_prenex_20 Int) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse0) (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= (select (select (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))))))) (forall ((v_ArrVal_814 (Array Int Int))) (or (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_27 v_prenex_16) v_prenex_20 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_prenex_20 v_arrayElimCell_27)))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_818 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_818) v_arrayElimCell_20 v_ArrVal_822))) (or (= (select (select (store (store .cse39 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_823) v_arrayElimCell_18 v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (not (= v_ArrVal_814 (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_814 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse39 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse6)))) is different from false [2023-11-29 04:39:00,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53656 treesize of output 53598 [2023-11-29 04:39:00,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2307 treesize of output 2299 [2023-11-29 04:39:00,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2299 treesize of output 2291 [2023-11-29 04:39:00,419 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:39:02,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:39:02,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 29 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 29 new quantified variables, introduced 58 case distinctions, treesize of input 2291 treesize of output 9774 [2023-11-29 04:39:04,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2001 treesize of output 1993 [2023-11-29 04:39:05,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1993 treesize of output 1989 [2023-11-29 04:39:07,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1989 treesize of output 1985 [2023-11-29 04:39:08,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1985 treesize of output 1977 [2023-11-29 04:39:09,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1977 treesize of output 1973 [2023-11-29 04:39:10,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1973 treesize of output 1969 [2023-11-29 04:39:11,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1969 treesize of output 1965 [2023-11-29 04:39:13,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1965 treesize of output 1953 [2023-11-29 04:39:14,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1953 treesize of output 1949 [2023-11-29 04:39:15,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1949 treesize of output 1945 [2023-11-29 04:39:16,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1945 treesize of output 1941 [2023-11-29 04:39:17,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1941 treesize of output 1937 [2023-11-29 04:39:19,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1937 treesize of output 1933 [2023-11-29 04:39:20,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1933 treesize of output 1929 [2023-11-29 04:39:21,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1929 treesize of output 1925 [2023-11-29 04:39:22,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1925 treesize of output 1921 [2023-11-29 04:39:23,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1921 treesize of output 1917 [2023-11-29 04:39:25,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1917 treesize of output 1913 [2023-11-29 04:39:26,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1913 treesize of output 1909 [2023-11-29 04:39:27,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1909 treesize of output 1905 [2023-11-29 04:39:28,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1905 treesize of output 1901 [2023-11-29 04:39:30,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1901 treesize of output 1897 [2023-11-29 04:39:31,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1897 treesize of output 1893 [2023-11-29 04:39:32,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1893 treesize of output 1889 [2023-11-29 04:39:33,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1889 treesize of output 1885 [2023-11-29 04:39:35,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1885 treesize of output 1881 [2023-11-29 04:39:36,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1881 treesize of output 1873 [2023-11-29 04:39:37,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1873 treesize of output 1865 [2023-11-29 04:39:38,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1865 treesize of output 1857 [2023-11-29 04:39:40,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1857 treesize of output 1853 [2023-11-29 04:39:41,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1853 treesize of output 1849 [2023-11-29 04:39:42,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1849 treesize of output 1837 [2023-11-29 04:39:44,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1837 treesize of output 1833 [2023-11-29 04:39:45,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1833 treesize of output 1829 [2023-11-29 04:39:46,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1829 treesize of output 1825 [2023-11-29 04:39:48,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1825 treesize of output 1821 [2023-11-29 04:39:49,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1821 treesize of output 1813 [2023-11-29 04:39:51,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1813 treesize of output 1809 [2023-11-29 04:39:52,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1809 treesize of output 1805 [2023-11-29 04:39:53,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1805 treesize of output 1801 [2023-11-29 04:39:55,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1801 treesize of output 1797 [2023-11-29 04:39:56,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1797 treesize of output 1785 [2023-11-29 04:39:58,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1785 treesize of output 1781 [2023-11-29 04:39:59,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1781 treesize of output 1773 [2023-11-29 04:40:00,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1773 treesize of output 1769 [2023-11-29 04:40:02,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1769 treesize of output 1765 [2023-11-29 04:40:03,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1765 treesize of output 1761 [2023-11-29 04:40:05,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1761 treesize of output 1757 [2023-11-29 04:40:06,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1757 treesize of output 1741 [2023-11-29 04:40:07,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1741 treesize of output 1737 [2023-11-29 04:40:09,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1737 treesize of output 1729 [2023-11-29 04:40:16,111 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:40:18,592 INFO L224 Elim1Store]: Index analysis took 2481 ms [2023-11-29 04:40:18,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:18,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 28 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 429 treesize of output 6371 [2023-11-29 04:40:36,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:40:36,206 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:40:36,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:40:36,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:40:36,234 INFO L349 Elim1Store]: treesize reduction 234, result has 0.4 percent of original size [2023-11-29 04:40:36,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 26 case distinctions, treesize of input 349 treesize of output 489 [2023-11-29 04:40:36,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:40:36,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:40:36,247 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:40:36,247 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 23 treesize of output 15 [2023-11-29 04:40:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066603236] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:40:37,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:40:37,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 32 [2023-11-29 04:40:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144221096] [2023-11-29 04:40:37,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:40:37,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 04:40:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 04:40:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=772, Unknown=40, NotChecked=118, Total=1056 [2023-11-29 04:40:37,088 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:42,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:40:45,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:41:18,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:41:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:18,435 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2023-11-29 04:41:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:41:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 04:41:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:18,437 INFO L225 Difference]: With dead ends: 156 [2023-11-29 04:41:18,437 INFO L226 Difference]: Without dead ends: 156 [2023-11-29 04:41:18,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=302, Invalid=1552, Unknown=46, NotChecked=170, Total=2070 [2023-11-29 04:41:18,438 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 200 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:18,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 609 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1084 Invalid, 1 Unknown, 256 Unchecked, 14.4s Time] [2023-11-29 04:41:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-29 04:41:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2023-11-29 04:41:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 141 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2023-11-29 04:41:18,443 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 30 [2023-11-29 04:41:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:18,443 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2023-11-29 04:41:18,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2023-11-29 04:41:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:41:18,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:18,444 INFO L195 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] [2023-11-29 04:41:18,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:41:18,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:41:18,645 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:41:18,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash 441747135, now seen corresponding path program 1 times [2023-11-29 04:41:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:41:18,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135786767] [2023-11-29 04:41:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:41:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:18,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:41:18,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135786767] [2023-11-29 04:41:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135786767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:18,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:18,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:41:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066660063] [2023-11-29 04:41:18,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:18,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:41:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:41:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:41:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:18,717 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:18,858 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2023-11-29 04:41:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:41:18,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 04:41:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:18,859 INFO L225 Difference]: With dead ends: 142 [2023-11-29 04:41:18,860 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 04:41:18,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:41:18,861 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:18,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:41:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 04:41:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-29 04:41:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 140 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2023-11-29 04:41:18,865 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 31 [2023-11-29 04:41:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:18,865 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2023-11-29 04:41:18,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2023-11-29 04:41:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:41:18,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:18,866 INFO L195 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] [2023-11-29 04:41:18,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 04:41:18,866 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:41:18,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1053702847, now seen corresponding path program 1 times [2023-11-29 04:41:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:41:18,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878101544] [2023-11-29 04:41:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:41:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:41:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878101544] [2023-11-29 04:41:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878101544] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:41:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018438409] [2023-11-29 04:41:19,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:19,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:41:19,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:41:19,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:41:19,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:41:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:19,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 04:41:19,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:19,800 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 [2023-11-29 04:41:19,894 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:41:19,894 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 [2023-11-29 04:41:19,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:41:20,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:41:20,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:41:20,089 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 04:41:20,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 04:41:20,155 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 04:41:20,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 04:41:20,170 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 04:41:20,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:41:20,225 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 04:41:20,226 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 1 case distinctions, treesize of input 43 treesize of output 23 [2023-11-29 04:41:20,342 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 04:41:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 50 [2023-11-29 04:41:20,439 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 04:41:20,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 57 [2023-11-29 04:41:20,585 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:41:20,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2023-11-29 04:41:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:20,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:41:20,913 INFO L349 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2023-11-29 04:41:20,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2023-11-29 04:41:20,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_96| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_96|) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1012))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1013)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) |c_ULTIMATE.start_main_~x~0#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_96| 0))) is different from false [2023-11-29 04:41:20,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:20,938 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-11-29 04:41:20,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_32 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_96| Int)) (let ((.cse1 (select v_arrayElimArr_32 |ULTIMATE.start_main_~x~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_96|) (< |v_ULTIMATE.start_main_~x~0#1.offset_96| 0) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_32) .cse1 v_ArrVal_1012))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1013)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= 0 (select |c_#valid| .cse1)))))) is different from false [2023-11-29 04:41:21,049 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_97| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_96| Int)) (let ((.cse2 (select v_arrayElimArr_32 |v_ULTIMATE.start_main_~x~0#1.offset_97|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_96|) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_32) .cse2 v_ArrVal_1012))) (store .cse1 (select (select .cse1 .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_97|) v_ArrVal_1013)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_96|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_96| 0) (not (= (select |c_#valid| .cse2) 0))))) is different from false [2023-11-29 04:41:21,072 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_97| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_96| Int)) (let ((.cse3 (select v_arrayElimArr_32 |v_ULTIMATE.start_main_~x~0#1.offset_97|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_96|) (< |v_ULTIMATE.start_main_~x~0#1.offset_96| 0) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1008))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (let ((.cse0 (store (store .cse2 .cse1 v_arrayElimArr_32) .cse3 v_ArrVal_1012))) (store .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_97|) v_ArrVal_1013)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) .cse1))) (not (= (select |c_#valid| .cse3) 0))))) is different from false [2023-11-29 04:41:21,094 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_97| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_96| Int)) (let ((.cse3 (select v_arrayElimArr_32 |v_ULTIMATE.start_main_~x~0#1.offset_97|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_96|) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1008))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store (store .cse2 .cse0 v_arrayElimArr_32) .cse3 v_ArrVal_1012))) (store .cse1 (select (select .cse1 .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_97|) v_ArrVal_1013)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_96| 0) (not (= (select |c_#valid| .cse3) 0))))) is different from false [2023-11-29 04:41:21,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:21,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 73 [2023-11-29 04:41:21,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:21,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53178 treesize of output 51849 [2023-11-29 04:41:21,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:21,481 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 738 treesize of output 617 [2023-11-29 04:41:21,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 794 treesize of output 746 [2023-11-29 04:41:21,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:21,524 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 746 treesize of output 690 [2023-11-29 04:41:21,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:21,549 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 690 treesize of output 628 [2023-11-29 04:41:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 04:41:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018438409] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:41:23,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:41:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 38 [2023-11-29 04:41:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752605086] [2023-11-29 04:41:23,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:41:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 04:41:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:41:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 04:41:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=971, Unknown=10, NotChecked=340, Total=1482 [2023-11-29 04:41:23,256 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:27,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:41:31,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:41:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:32,897 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2023-11-29 04:41:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:41:32,897 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 04:41:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:32,898 INFO L225 Difference]: With dead ends: 196 [2023-11-29 04:41:32,898 INFO L226 Difference]: Without dead ends: 196 [2023-11-29 04:41:32,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=277, Invalid=1455, Unknown=10, NotChecked=420, Total=2162 [2023-11-29 04:41:32,899 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 290 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 953 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:32,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 823 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1515 Invalid, 2 Unknown, 953 Unchecked, 9.2s Time] [2023-11-29 04:41:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-29 04:41:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2023-11-29 04:41:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.2962962962962963) internal successors, (175), 158 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2023-11-29 04:41:32,902 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 30 [2023-11-29 04:41:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:32,903 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2023-11-29 04:41:32,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2023-11-29 04:41:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:41:32,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:32,903 INFO L195 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] [2023-11-29 04:41:32,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:41:33,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:41:33,104 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:41:33,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:33,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1053702846, now seen corresponding path program 1 times [2023-11-29 04:41:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:41:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275733896] [2023-11-29 04:41:33,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:33,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:41:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:41:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275733896] [2023-11-29 04:41:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275733896] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:41:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563096496] [2023-11-29 04:41:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:34,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:41:34,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:41:34,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:41:34,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:41:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:34,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 04:41:34,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:34,190 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 [2023-11-29 04:41:34,258 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:41:34,258 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 [2023-11-29 04:41:34,291 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 [2023-11-29 04:41:34,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:41:34,409 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:41:34,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 04:41:34,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:41:34,485 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:41:34,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 04:41:34,503 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 04:41:34,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-29 04:41:34,643 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:41:34,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 04:41:34,665 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 04:41:34,666 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 16 treesize of output 18 [2023-11-29 04:41:34,683 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 04:41:34,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-29 04:41:34,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:41:34,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:41:34,761 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:41:34,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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 04:41:34,782 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 04:41:34,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-11-29 04:41:34,942 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 04:41:34,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 60 [2023-11-29 04:41:34,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:41:35,067 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 04:41:35,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 71 [2023-11-29 04:41:35,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2023-11-29 04:41:35,261 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:41:35,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2023-11-29 04:41:35,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:41:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:35,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:41:36,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:36,129 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 106 [2023-11-29 04:41:36,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:36,564 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 231 treesize of output 235 [2023-11-29 04:41:38,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:38,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 567 treesize of output 560 [2023-11-29 04:41:38,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:38,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 551 treesize of output 376 [2023-11-29 04:41:38,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:38,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11469 treesize of output 10223 [2023-11-29 04:41:38,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:38,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 12461 treesize of output 12303 [2023-11-29 04:41:39,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3460 treesize of output 3456 [2023-11-29 04:41:39,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3456 treesize of output 3424 [2023-11-29 04:41:39,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3424 treesize of output 3388 [2023-11-29 04:41:39,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3388 treesize of output 3366 [2023-11-29 04:41:39,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3366 treesize of output 3292 [2023-11-29 04:41:39,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3292 treesize of output 3288 [2023-11-29 04:41:39,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3288 treesize of output 3276 [2023-11-29 04:41:39,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3276 treesize of output 3260 [2023-11-29 04:41:39,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3260 treesize of output 3224 [2023-11-29 04:41:39,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3224 treesize of output 3210 [2023-11-29 04:41:39,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3210 treesize of output 3198 [2023-11-29 04:41:39,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3198 treesize of output 3186 [2023-11-29 04:41:39,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3186 treesize of output 3156 [2023-11-29 04:41:39,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3156 treesize of output 3144 [2023-11-29 04:41:40,650 INFO L349 Elim1Store]: treesize reduction 4, result has 99.1 percent of original size [2023-11-29 04:41:40,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 3151 treesize of output 3545 [2023-11-29 04:41:41,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3072 treesize of output 3036 [2023-11-29 04:41:41,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:41,320 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 3133 treesize of output 2825 [2023-11-29 04:41:41,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:41,486 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 2833 treesize of output 2743 [2023-11-29 04:41:41,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2658 treesize of output 2626 [2023-11-29 04:41:41,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:41,790 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 2719 treesize of output 2645 [2023-11-29 04:41:41,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:41,967 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 2653 treesize of output 2567 [2023-11-29 04:41:42,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:42,131 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 2486 treesize of output 2431 [2023-11-29 04:41:42,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:42,304 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 2422 treesize of output 2375 [2023-11-29 04:45:11,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 04:45:11,296 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 04:45:11,297 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 04:45:11,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:45:11,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 04:45:11,498 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_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 78 more [2023-11-29 04:45:11,501 INFO L158 Benchmark]: Toolchain (without parser) took 439084.84ms. Allocated memory was 132.1MB in the beginning and 589.3MB in the end (delta: 457.2MB). Free memory was 93.0MB in the beginning and 433.6MB in the end (delta: -340.7MB). Peak memory consumption was 364.5MB. Max. memory is 16.1GB. [2023-11-29 04:45:11,501 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:45:11,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.08ms. Allocated memory is still 132.1MB. Free memory was 93.0MB in the beginning and 75.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:45:11,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.83ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 72.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:45:11,502 INFO L158 Benchmark]: Boogie Preprocessor took 54.18ms. Allocated memory is still 132.1MB. Free memory was 72.8MB in the beginning and 70.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:45:11,502 INFO L158 Benchmark]: RCFGBuilder took 562.46ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 70.0MB in the beginning and 127.7MB in the end (delta: -57.7MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2023-11-29 04:45:11,502 INFO L158 Benchmark]: TraceAbstraction took 438060.14ms. Allocated memory was 161.5MB in the beginning and 589.3MB in the end (delta: 427.8MB). Free memory was 126.7MB in the beginning and 433.6MB in the end (delta: -307.0MB). Peak memory consumption was 367.2MB. Max. memory is 16.1GB. [2023-11-29 04:45:11,503 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.17ms. Allocated memory is still 132.1MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.08ms. Allocated memory is still 132.1MB. Free memory was 93.0MB in the beginning and 75.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.83ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 72.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.18ms. Allocated memory is still 132.1MB. Free memory was 72.8MB in the beginning and 70.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.46ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 70.0MB in the beginning and 127.7MB in the end (delta: -57.7MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 438060.14ms. Allocated memory was 161.5MB in the beginning and 589.3MB in the end (delta: 427.8MB). Free memory was 126.7MB in the beginning and 433.6MB in the end (delta: -307.0MB). Peak memory consumption was 367.2MB. 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_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/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_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya --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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:45:13,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:45:13,264 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:45:13,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:45:13,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:45:13,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:45:13,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:45:13,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:45:13,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:45:13,308 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:45:13,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:45:13,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:45:13,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:45:13,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:45:13,311 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:45:13,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:45:13,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:45:13,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:45:13,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:45:13,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:45:13,314 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:45:13,315 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:45:13,316 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:45:13,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:45:13,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:45:13,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:45:13,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:45:13,318 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:45:13,318 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:45:13,319 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:45:13,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:45:13,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:45:13,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:45:13,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:45:13,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:13,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:45:13,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:45:13,321 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:45:13,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:45:13,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:45:13,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:45:13,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:45:13,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:45:13,323 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:45:13,323 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-11-29 04:45:13,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:45:13,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:45:13,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:45:13,637 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:45:13,638 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:45:13,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-29 04:45:16,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:45:16,683 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:45:16,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-29 04:45:16,698 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data/cef2b3fed/9230193b57be427da082e1c49b299ca4/FLAG7307a4229 [2023-11-29 04:45:16,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/data/cef2b3fed/9230193b57be427da082e1c49b299ca4 [2023-11-29 04:45:16,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:45:16,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:45:16,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:16,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:45:16,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:45:16,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:16" (1/1) ... [2023-11-29 04:45:16,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3c5b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:16, skipping insertion in model container [2023-11-29 04:45:16,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:16" (1/1) ... [2023-11-29 04:45:16,764 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:45:17,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:17,032 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:45:17,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:17,124 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:45:17,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17 WrapperNode [2023-11-29 04:45:17,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:17,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:17,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:45:17,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:45:17,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,174 INFO L138 Inliner]: procedures = 122, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-29 04:45:17,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:17,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:45:17,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:45:17,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:45:17,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,204 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-11-29 04:45:17,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:45:17,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:45:17,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:45:17,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:45:17,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:45:17,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:45:17,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:45:17,303 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 04:45:17,304 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 04:45:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:45:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:45:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:45:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:45:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:45:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:45:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:45:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:45:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:45:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:45:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:45:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:45:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:45:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:45:17,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:45:17,429 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:45:17,431 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:45:17,956 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:45:18,006 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:45:18,006 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-29 04:45:18,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:18 BoogieIcfgContainer [2023-11-29 04:45:18,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:45:18,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:45:18,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:45:18,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:45:18,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:45:16" (1/3) ... [2023-11-29 04:45:18,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6789de48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:18, skipping insertion in model container [2023-11-29 04:45:18,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (2/3) ... [2023-11-29 04:45:18,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6789de48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:18, skipping insertion in model container [2023-11-29 04:45:18,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:18" (3/3) ... [2023-11-29 04:45:18,014 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-11-29 04:45:18,028 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:45:18,028 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-29 04:45:18,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:45:18,074 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2ff8b059, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:45:18,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-29 04:45:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:45:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:45:18,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:18,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:45:18,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:18,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 9685, now seen corresponding path program 1 times [2023-11-29 04:45:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:18,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517058275] [2023-11-29 04:45:18,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:18,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:18,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:18,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:18,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:45:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:45:18,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:18,228 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 [2023-11-29 04:45:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:18,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:18,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517058275] [2023-11-29 04:45:18,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517058275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:18,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:18,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:45:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35812396] [2023-11-29 04:45:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:18,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:45:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:45:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:45:18,270 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:18,550 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-11-29 04:45:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:45:18,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 04:45:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:18,560 INFO L225 Difference]: With dead ends: 136 [2023-11-29 04:45:18,561 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 04:45:18,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:45:18,565 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:18,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:45:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 04:45:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2023-11-29 04:45:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-11-29 04:45:18,603 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2023-11-29 04:45:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:18,604 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-11-29 04:45:18,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-11-29 04:45:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:45:18,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:18,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:45:18,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:45:18,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:18,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:18,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 9686, now seen corresponding path program 1 times [2023-11-29 04:45:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208843016] [2023-11-29 04:45:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:18,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:18,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:18,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:45:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:45:18,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:18,896 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 [2023-11-29 04:45:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:18,907 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:18,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208843016] [2023-11-29 04:45:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208843016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:18,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:18,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:45:18,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505420650] [2023-11-29 04:45:18,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:18,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:45:18,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:45:18,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:45:18,912 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:19,216 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2023-11-29 04:45:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:45:19,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 04:45:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:19,218 INFO L225 Difference]: With dead ends: 140 [2023-11-29 04:45:19,218 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 04:45:19,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:45:19,220 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:19,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 96 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:45:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 04:45:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2023-11-29 04:45:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2023-11-29 04:45:19,233 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2023-11-29 04:45:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:19,233 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2023-11-29 04:45:19,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2023-11-29 04:45:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:45:19,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:19,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:19,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:45:19,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:19,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:19,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866331, now seen corresponding path program 1 times [2023-11-29 04:45:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919078798] [2023-11-29 04:45:19,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:19,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:19,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:19,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:45:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:19,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:45:19,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:19,518 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 [2023-11-29 04:45:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:19,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:19,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919078798] [2023-11-29 04:45:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919078798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:45:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74549636] [2023-11-29 04:45:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:19,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:45:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:45:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:45:19,547 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:19,924 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-29 04:45:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:45:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:45:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:19,926 INFO L225 Difference]: With dead ends: 116 [2023-11-29 04:45:19,926 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 04:45:19,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:19,928 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:19,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:45:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 04:45:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2023-11-29 04:45:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-29 04:45:19,938 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2023-11-29 04:45:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:19,938 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-29 04:45:19,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-29 04:45:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:45:19,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:19,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:19,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:45:20,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:20,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:20,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866330, now seen corresponding path program 1 times [2023-11-29 04:45:20,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:20,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680195814] [2023-11-29 04:45:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:20,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:20,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:20,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:20,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:45:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:45:20,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:20,217 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 [2023-11-29 04:45:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:20,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:20,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:20,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680195814] [2023-11-29 04:45:20,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680195814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:20,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:20,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:45:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311928987] [2023-11-29 04:45:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:20,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:45:20,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:20,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:45:20,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:45:20,281 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:20,735 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2023-11-29 04:45:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:45:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:45:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:20,737 INFO L225 Difference]: With dead ends: 178 [2023-11-29 04:45:20,737 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 04:45:20,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:20,739 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 185 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:20,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 97 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:45:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 04:45:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 131. [2023-11-29 04:45:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.6666666666666667) internal successors, (145), 129 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2023-11-29 04:45:20,751 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 7 [2023-11-29 04:45:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:20,751 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2023-11-29 04:45:20,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2023-11-29 04:45:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:45:20,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:20,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:20,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:45:20,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:20,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:20,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222096, now seen corresponding path program 1 times [2023-11-29 04:45:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327609675] [2023-11-29 04:45:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:20,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:20,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:20,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:20,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:45:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:21,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:45:21,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:21,036 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 [2023-11-29 04:45:21,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:21,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 04:45:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:21,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:21,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327609675] [2023-11-29 04:45:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327609675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:45:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862654523] [2023-11-29 04:45:21,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:21,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:45:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:21,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:45:21,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:21,078 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:45:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:21,477 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2023-11-29 04:45:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:45:21,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2023-11-29 04:45:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:21,479 INFO L225 Difference]: With dead ends: 130 [2023-11-29 04:45:21,479 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 04:45:21,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:45:21,480 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:21,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:45:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 04:45:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-29 04:45:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 128 states have internal predecessors, (143), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2023-11-29 04:45:21,488 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 9 [2023-11-29 04:45:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:21,488 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2023-11-29 04:45:21,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:45:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2023-11-29 04:45:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:45:21,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:21,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:21,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:45:21,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:21,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:21,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222095, now seen corresponding path program 1 times [2023-11-29 04:45:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406022228] [2023-11-29 04:45:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:21,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:21,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:45:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:21,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:45:21,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:21,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 [2023-11-29 04:45:21,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:21,805 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 [2023-11-29 04:45:21,836 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 17 treesize of output 9 [2023-11-29 04:45:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:21,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:21,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406022228] [2023-11-29 04:45:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406022228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:21,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:21,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:45:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531808842] [2023-11-29 04:45:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:21,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:45:21,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:21,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:45:21,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:21,854 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:45:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:22,237 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-11-29 04:45:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:45:22,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2023-11-29 04:45:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:22,239 INFO L225 Difference]: With dead ends: 129 [2023-11-29 04:45:22,239 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 04:45:22,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:45:22,240 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:22,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:45:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 04:45:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-29 04:45:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 127 states have internal predecessors, (141), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2023-11-29 04:45:22,247 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 9 [2023-11-29 04:45:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:22,247 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2023-11-29 04:45:22,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-29 04:45:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2023-11-29 04:45:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 04:45:22,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:22,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:22,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:45:22,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:22,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:22,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224648, now seen corresponding path program 1 times [2023-11-29 04:45:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091005508] [2023-11-29 04:45:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:22,451 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:22,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:45:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:22,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:45:22,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:22,536 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 [2023-11-29 04:45:22,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:22,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 04:45:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:22,575 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:22,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091005508] [2023-11-29 04:45:22,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091005508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:45:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211891814] [2023-11-29 04:45:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:22,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:45:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:45:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:22,577 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:22,943 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2023-11-29 04:45:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:45:22,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 04:45:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:22,944 INFO L225 Difference]: With dead ends: 128 [2023-11-29 04:45:22,944 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 04:45:22,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:45:22,945 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:22,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:45:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 04:45:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-29 04:45:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.5977011494252873) internal successors, (139), 126 states have internal predecessors, (139), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2023-11-29 04:45:22,951 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 10 [2023-11-29 04:45:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:22,952 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2023-11-29 04:45:22,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2023-11-29 04:45:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 04:45:22,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:22,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:22,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:45:23,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:23,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:23,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224649, now seen corresponding path program 1 times [2023-11-29 04:45:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535113868] [2023-11-29 04:45:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:23,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:23,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:23,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:45:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:45:23,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:23,234 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 [2023-11-29 04:45:23,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:23,258 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 [2023-11-29 04:45:23,282 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 17 treesize of output 9 [2023-11-29 04:45:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:23,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:23,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535113868] [2023-11-29 04:45:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535113868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:23,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:45:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767868881] [2023-11-29 04:45:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:23,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:45:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:23,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:45:23,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:23,300 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:23,699 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2023-11-29 04:45:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:45:23,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 04:45:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:23,701 INFO L225 Difference]: With dead ends: 127 [2023-11-29 04:45:23,701 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 04:45:23,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:45:23,702 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:23,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:45:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 04:45:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-29 04:45:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 125 states have internal predecessors, (137), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2023-11-29 04:45:23,706 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 10 [2023-11-29 04:45:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:23,706 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2023-11-29 04:45:23,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2023-11-29 04:45:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:45:23,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:23,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:23,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 04:45:23,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:23,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:23,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash 327030838, now seen corresponding path program 1 times [2023-11-29 04:45:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:23,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401921242] [2023-11-29 04:45:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:23,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:23,909 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:23,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:45:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:45:24,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:24,033 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 04:45:24,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 04:45:24,149 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 04:45:24,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 04:45:24,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:24,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:24,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-11-29 04:45:24,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-11-29 04:45:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:24,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:24,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401921242] [2023-11-29 04:45:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401921242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:24,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:24,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:45:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971683629] [2023-11-29 04:45:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:24,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:45:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:24,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:45:24,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:45:24,521 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:25,727 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2023-11-29 04:45:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:45:25,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:45:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:25,728 INFO L225 Difference]: With dead ends: 155 [2023-11-29 04:45:25,728 INFO L226 Difference]: Without dead ends: 155 [2023-11-29 04:45:25,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:45:25,729 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 193 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:25,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 204 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:45:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-29 04:45:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2023-11-29 04:45:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.5795454545454546) internal successors, (139), 126 states have internal predecessors, (139), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2023-11-29 04:45:25,734 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 11 [2023-11-29 04:45:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:25,734 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2023-11-29 04:45:25,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2023-11-29 04:45:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:45:25,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:25,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:25,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:45:25,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:25,936 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:25,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash 327030839, now seen corresponding path program 1 times [2023-11-29 04:45:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:25,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727969053] [2023-11-29 04:45:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:25,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:25,938 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:25,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:45:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:26,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 04:45:26,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:26,048 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 [2023-11-29 04:45:26,088 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:26,088 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 [2023-11-29 04:45:26,096 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 [2023-11-29 04:45:26,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:26,135 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 [2023-11-29 04:45:26,231 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:26,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:45:26,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 24 treesize of output 11 [2023-11-29 04:45:26,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:45:26,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:45:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:26,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:26,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727969053] [2023-11-29 04:45:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727969053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:45:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233734749] [2023-11-29 04:45:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:26,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:45:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:26,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:45:26,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:45:26,289 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:27,164 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2023-11-29 04:45:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:45:27,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:45:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:27,165 INFO L225 Difference]: With dead ends: 127 [2023-11-29 04:45:27,165 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 04:45:27,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:45:27,166 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 145 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:27,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 172 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:45:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 04:45:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2023-11-29 04:45:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.5060240963855422) internal successors, (125), 113 states have internal predecessors, (125), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2023-11-29 04:45:27,171 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 11 [2023-11-29 04:45:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:27,171 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2023-11-29 04:45:27,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2023-11-29 04:45:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:45:27,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:27,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:27,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:45:27,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:27,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:27,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash 164325843, now seen corresponding path program 1 times [2023-11-29 04:45:27,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:27,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209889710] [2023-11-29 04:45:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:27,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:27,374 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:27,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:45:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:27,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:45:27,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:27,493 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 04:45:27,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 04:45:27,610 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 04:45:27,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 04:45:27,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:27,802 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:27,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-11-29 04:45:27,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-11-29 04:45:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:27,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:27,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209889710] [2023-11-29 04:45:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209889710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:27,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:27,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:45:27,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122386351] [2023-11-29 04:45:27,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:27,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:45:27,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:27,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:45:27,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:45:27,898 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:28,846 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2023-11-29 04:45:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:45:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 04:45:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:28,848 INFO L225 Difference]: With dead ends: 131 [2023-11-29 04:45:28,848 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 04:45:28,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:45:28,849 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 127 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:28,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 202 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:45:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 04:45:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2023-11-29 04:45:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 119 states have internal predecessors, (132), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2023-11-29 04:45:28,865 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 12 [2023-11-29 04:45:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:28,865 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2023-11-29 04:45:28,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2023-11-29 04:45:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:45:28,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:28,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:28,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:45:29,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:29,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:29,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash 164325844, now seen corresponding path program 1 times [2023-11-29 04:45:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:29,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358245961] [2023-11-29 04:45:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:29,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:29,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:29,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:29,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:45:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:29,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 04:45:29,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:29,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:45:29,243 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 [2023-11-29 04:45:29,251 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:29,252 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 [2023-11-29 04:45:29,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:29,287 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 [2023-11-29 04:45:29,368 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:29,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:45:29,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:29,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:45:29,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:45:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:29,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:29,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358245961] [2023-11-29 04:45:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358245961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:45:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864015928] [2023-11-29 04:45:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:29,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:45:29,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:29,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:45:29,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:45:29,423 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:30,146 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-11-29 04:45:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:45:30,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 04:45:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:30,148 INFO L225 Difference]: With dead ends: 124 [2023-11-29 04:45:30,148 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 04:45:30,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:45:30,149 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 129 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:30,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 210 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:45:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 04:45:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-11-29 04:45:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 118 states have internal predecessors, (130), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2023-11-29 04:45:30,152 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 12 [2023-11-29 04:45:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:30,152 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2023-11-29 04:45:30,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2023-11-29 04:45:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:45:30,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:30,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:30,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:45:30,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:30,353 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:30,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2042218147, now seen corresponding path program 1 times [2023-11-29 04:45:30,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:30,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571476101] [2023-11-29 04:45:30,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:30,355 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:30,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:45:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:30,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:45:30,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:30,479 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 11 [2023-11-29 04:45:30,493 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 11 [2023-11-29 04:45:30,508 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:30,508 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 [2023-11-29 04:45:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:30,515 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:30,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:30,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571476101] [2023-11-29 04:45:30,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571476101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:45:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212011759] [2023-11-29 04:45:30,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:30,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:45:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:30,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:45:30,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:45:30,517 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:30,720 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2023-11-29 04:45:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:45:30,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 04:45:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:30,722 INFO L225 Difference]: With dead ends: 119 [2023-11-29 04:45:30,722 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 04:45:30,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:30,723 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 126 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:30,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 54 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:45:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 04:45:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-29 04:45:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.449438202247191) internal successors, (129), 117 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2023-11-29 04:45:30,726 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 15 [2023-11-29 04:45:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:30,726 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2023-11-29 04:45:30,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2023-11-29 04:45:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 04:45:30,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:30,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:30,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:45:30,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:30,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:30,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash 174750842, now seen corresponding path program 1 times [2023-11-29 04:45:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499609670] [2023-11-29 04:45:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:30,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:30,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:30,930 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:30,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:45:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:31,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:45:31,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:31,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:31,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499609670] [2023-11-29 04:45:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499609670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:45:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484982450] [2023-11-29 04:45:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:31,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:45:31,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:45:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:45:31,056 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:31,328 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2023-11-29 04:45:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:45:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 04:45:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:31,329 INFO L225 Difference]: With dead ends: 157 [2023-11-29 04:45:31,329 INFO L226 Difference]: Without dead ends: 157 [2023-11-29 04:45:31,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:31,330 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:31,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 125 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:45:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-29 04:45:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 118. [2023-11-29 04:45:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 116 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2023-11-29 04:45:31,335 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 16 [2023-11-29 04:45:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:31,335 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2023-11-29 04:45:31,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2023-11-29 04:45:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:45:31,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:31,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:31,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:45:31,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:31,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:31,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash -622081400, now seen corresponding path program 1 times [2023-11-29 04:45:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:31,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016290029] [2023-11-29 04:45:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:31,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:31,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:31,541 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:31,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:45:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:31,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:45:31,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:31,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:31,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016290029] [2023-11-29 04:45:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016290029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:31,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:31,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:45:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176729957] [2023-11-29 04:45:31,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:31,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:45:31,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:31,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:45:31,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:31,672 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:32,034 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2023-11-29 04:45:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:45:32,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 04:45:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:32,035 INFO L225 Difference]: With dead ends: 117 [2023-11-29 04:45:32,036 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 04:45:32,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:45:32,036 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:32,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:45:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 04:45:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-29 04:45:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 115 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2023-11-29 04:45:32,040 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 21 [2023-11-29 04:45:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:32,041 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2023-11-29 04:45:32,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2023-11-29 04:45:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:45:32,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:32,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:32,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-29 04:45:32,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:32,243 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:32,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash -590564444, now seen corresponding path program 1 times [2023-11-29 04:45:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:32,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820283362] [2023-11-29 04:45:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:32,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:32,248 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:32,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 04:45:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:32,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 04:45:32,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:32,468 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 [2023-11-29 04:45:32,525 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 [2023-11-29 04:45:32,542 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:32,543 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 [2023-11-29 04:45:32,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:32,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:45:32,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:45:32,705 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:32,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 04:45:32,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2023-11-29 04:45:32,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 04:45:32,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 04:45:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:32,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:32,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820283362] [2023-11-29 04:45:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820283362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:45:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140923293] [2023-11-29 04:45:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:32,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:45:32,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:45:32,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:45:32,808 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:33,686 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2023-11-29 04:45:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:45:33,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 04:45:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:33,688 INFO L225 Difference]: With dead ends: 133 [2023-11-29 04:45:33,688 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 04:45:33,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:45:33,689 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 100 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:33,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 241 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:45:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 04:45:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2023-11-29 04:45:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 119 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2023-11-29 04:45:33,692 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 21 [2023-11-29 04:45:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:33,693 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2023-11-29 04:45:33,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2023-11-29 04:45:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:45:33,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:33,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:33,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-29 04:45:33,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:33,894 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:33,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash -811284611, now seen corresponding path program 1 times [2023-11-29 04:45:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015270339] [2023-11-29 04:45:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:33,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:33,896 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:33,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 04:45:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:34,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:45:34,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:34,089 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:45:34,089 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 [2023-11-29 04:45:34,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:34,184 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:34,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:45:34,199 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 27 treesize of output 15 [2023-11-29 04:45:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:34,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:34,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015270339] [2023-11-29 04:45:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015270339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:34,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:34,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:45:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880199412] [2023-11-29 04:45:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:34,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:45:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:45:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:45:34,229 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:34,603 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-11-29 04:45:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:45:34,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 04:45:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:34,604 INFO L225 Difference]: With dead ends: 120 [2023-11-29 04:45:34,604 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 04:45:34,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:45:34,605 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:34,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 92 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:45:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 04:45:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2023-11-29 04:45:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 113 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2023-11-29 04:45:34,609 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 20 [2023-11-29 04:45:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:34,610 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2023-11-29 04:45:34,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2023-11-29 04:45:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:45:34,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:34,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:34,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 04:45:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:34,811 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:34,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -622050630, now seen corresponding path program 1 times [2023-11-29 04:45:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451874157] [2023-11-29 04:45:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:34,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:34,813 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:34,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 04:45:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:34,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:45:34,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:34,958 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 [2023-11-29 04:45:35,019 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:45:35,019 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 [2023-11-29 04:45:35,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:35,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:35,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 36 treesize of output 35 [2023-11-29 04:45:35,236 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:35,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:45:35,314 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 27 treesize of output 15 [2023-11-29 04:45:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:35,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:35,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:35,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451874157] [2023-11-29 04:45:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451874157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:35,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:45:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935000713] [2023-11-29 04:45:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:35,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:45:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:45:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:45:35,342 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2023-11-29 04:45:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:36,185 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2023-11-29 04:45:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:45:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 [2023-11-29 04:45:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:36,187 INFO L225 Difference]: With dead ends: 151 [2023-11-29 04:45:36,187 INFO L226 Difference]: Without dead ends: 151 [2023-11-29 04:45:36,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:45:36,188 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 196 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:36,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 215 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:45:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-29 04:45:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2023-11-29 04:45:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 118 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2023-11-29 04:45:36,192 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 21 [2023-11-29 04:45:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:36,192 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2023-11-29 04:45:36,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2023-11-29 04:45:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2023-11-29 04:45:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:45:36,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:36,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:36,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:45:36,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:36,394 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:36,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -622050629, now seen corresponding path program 1 times [2023-11-29 04:45:36,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:36,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941164958] [2023-11-29 04:45:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:36,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:36,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:36,395 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:36,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 04:45:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:36,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 04:45:36,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:36,549 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 [2023-11-29 04:45:36,599 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 [2023-11-29 04:45:36,616 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:36,616 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 [2023-11-29 04:45:36,651 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 [2023-11-29 04:45:36,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:36,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:36,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:45:36,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:36,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:36,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:45:36,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:36,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:45:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:45:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:36,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:36,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:36,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941164958] [2023-11-29 04:45:36,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941164958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:36,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:36,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:45:36,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871701316] [2023-11-29 04:45:36,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:36,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:45:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:45:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:45:36,948 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2023-11-29 04:45:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:37,900 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2023-11-29 04:45:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:45:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 [2023-11-29 04:45:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:37,901 INFO L225 Difference]: With dead ends: 136 [2023-11-29 04:45:37,901 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 04:45:37,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:45:37,902 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 142 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:37,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 255 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:45:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 04:45:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2023-11-29 04:45:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-29 04:45:37,907 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 21 [2023-11-29 04:45:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:37,907 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-29 04:45:37,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2023-11-29 04:45:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-29 04:45:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:45:37,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:37,908 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:37,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 04:45:38,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:38,108 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:38,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash -763714708, now seen corresponding path program 1 times [2023-11-29 04:45:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418064500] [2023-11-29 04:45:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:38,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:38,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:38,110 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:38,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 04:45:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:38,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:45:38,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:38,310 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:45:38,310 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 [2023-11-29 04:45:38,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:38,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:38,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:45:38,414 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 27 treesize of output 15 [2023-11-29 04:45:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:45:38,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:38,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418064500] [2023-11-29 04:45:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418064500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:38,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:38,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:45:38,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32186860] [2023-11-29 04:45:38,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:38,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:45:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:38,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:45:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:45:38,438 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:38,836 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-11-29 04:45:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:45:38,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 04:45:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:38,838 INFO L225 Difference]: With dead ends: 119 [2023-11-29 04:45:38,838 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 04:45:38,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:45:38,839 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:38,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:45:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 04:45:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-29 04:45:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-29 04:45:38,842 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 21 [2023-11-29 04:45:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:38,842 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-29 04:45:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-29 04:45:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:45:38,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:38,843 INFO L195 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] [2023-11-29 04:45:38,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 04:45:39,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:39,044 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:39,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash 830531664, now seen corresponding path program 1 times [2023-11-29 04:45:39,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:39,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517179885] [2023-11-29 04:45:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:39,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:39,046 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:39,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 04:45:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:39,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 04:45:39,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:39,202 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 [2023-11-29 04:45:39,255 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:39,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:45:39,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:39,342 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:39,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 04:45:39,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 04:45:39,404 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:39,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2023-11-29 04:45:39,410 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 25 treesize of output 17 [2023-11-29 04:45:39,413 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 34 treesize of output 21 [2023-11-29 04:45:39,487 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 21 [2023-11-29 04:45:39,490 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 21 treesize of output 13 [2023-11-29 04:45:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:39,527 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:39,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517179885] [2023-11-29 04:45:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517179885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:45:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035448182] [2023-11-29 04:45:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:39,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:45:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:39,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:45:39,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:45:39,529 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:40,672 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2023-11-29 04:45:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:45:40,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 04:45:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:40,673 INFO L225 Difference]: With dead ends: 134 [2023-11-29 04:45:40,673 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 04:45:40,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:45:40,674 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 97 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:40,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 320 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:45:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 04:45:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2023-11-29 04:45:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-29 04:45:40,677 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 25 [2023-11-29 04:45:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:40,677 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-29 04:45:40,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-29 04:45:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:45:40,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:40,678 INFO L195 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] [2023-11-29 04:45:40,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-29 04:45:40,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:40,878 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:40,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 228498532, now seen corresponding path program 1 times [2023-11-29 04:45:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818017750] [2023-11-29 04:45:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:40,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:40,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:40,880 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:40,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 04:45:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:40,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:45:40,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:41,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:41,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:41,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818017750] [2023-11-29 04:45:41,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818017750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:41,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:41,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:45:41,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409938552] [2023-11-29 04:45:41,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:41,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:45:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:45:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:45:41,088 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:41,686 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2023-11-29 04:45:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:45:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 04:45:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:41,689 INFO L225 Difference]: With dead ends: 162 [2023-11-29 04:45:41,689 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 04:45:41,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:45:41,690 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 108 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:41,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 245 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:45:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 04:45:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2023-11-29 04:45:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 100 states have (on average 1.38) internal successors, (138), 124 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2023-11-29 04:45:41,694 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 29 [2023-11-29 04:45:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:41,694 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2023-11-29 04:45:41,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:45:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2023-11-29 04:45:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:45:41,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:41,695 INFO L195 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] [2023-11-29 04:45:41,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 04:45:41,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:41,895 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-29 04:45:41,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1022216661, now seen corresponding path program 1 times [2023-11-29 04:45:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530961721] [2023-11-29 04:45:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:41,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:41,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:41,897 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:41,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b82c2e0-c7d9-4d29-9dc1-3af16363a8e3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 04:45:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:42,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 04:45:42,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:42,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 [2023-11-29 04:45:42,152 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 [2023-11-29 04:45:42,218 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:45:42,218 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 [2023-11-29 04:45:42,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:42,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:45:42,421 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:42,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-11-29 04:45:42,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:42,460 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 27 treesize of output 15 [2023-11-29 04:45:42,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:45:42,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:45:42,591 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 04:45:42,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:45:42,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:42,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:45:42,758 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:42,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 04:45:42,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:42,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:45:42,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:45:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:42,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:45:42,903 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv0 32))) is different from false [2023-11-29 04:45:42,966 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_946) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv0 32))) is different from false [2023-11-29 04:45:42,977 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_946) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_947) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_948)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv0 32))) is different from false [2023-11-29 04:45:42,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:45:42,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-11-29 04:45:42,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-11-29 04:45:42,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 04:45:43,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_26| (_ BitVec 32)) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_940) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_944))) (or (forall ((v_ArrVal_946 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_85 (_ BitVec 32))) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_26| v_ArrVal_946) v_arrayElimCell_85 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv0 32))) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_26| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_26|))))) (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse2) (_ bv0 1))) (forall ((v_ArrVal_946 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_85 (_ BitVec 32)) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_940) .cse2 v_ArrVal_946) v_arrayElimCell_85 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv0 32)))))) (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_26| (_ BitVec 32)) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_26|) (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_940) .cse3 v_ArrVal_944) |v_ULTIMATE.start_main_#t~malloc6#1.base_26| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_26|)))))))) is different from false [2023-11-29 04:45:43,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_941) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) (_ bv0 1))) (forall ((v_ArrVal_946 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_85 (_ BitVec 32)) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| .cse1 v_ArrVal_940) .cse0 v_ArrVal_946) v_arrayElimCell_85 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv0 32)))))) (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_26| (_ BitVec 32)) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_941) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| .cse1 v_ArrVal_940) .cse3 v_ArrVal_944) |v_ULTIMATE.start_main_#t~malloc6#1.base_26| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv0 32))) (= .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_26|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_26|)))))) (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_26| (_ BitVec 32)) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int#1| .cse1 v_ArrVal_940) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_941) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_944))) (or (forall ((v_ArrVal_946 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_85 (_ BitVec 32))) (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc6#1.base_26| v_ArrVal_946) v_arrayElimCell_85 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv0 32))) (= (select (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc6#1.base_26| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_26|))))))) is different from false [2023-11-29 04:45:44,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:45:44,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2023-11-29 04:45:44,008 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 149 treesize of output 137 [2023-11-29 04:45:44,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2023-11-29 04:45:44,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:45:44,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2023-11-29 04:45:44,452 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 104 treesize of output 92 [2023-11-29 04:45:44,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2023-11-29 04:45:44,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:45:44,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2023-11-29 04:45:44,621 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 97 treesize of output 85 [2023-11-29 04:45:44,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-11-29 04:46:30,414 WARN L293 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:47:14,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-11-29 04:47:14,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 04:47:14,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-11-29 04:47:14,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:47:14,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 70 [2023-11-29 04:47:14,306 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,311 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 294 treesize of output 258 [2023-11-29 04:47:14,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:47:14,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:47:14,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:14,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:14,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:47:14,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:14,411 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 04:47:14,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-11-29 04:47:14,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:47:14,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:14,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:47:14,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:14,485 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:47:14,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:14,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:47:14,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2023-11-29 04:47:14,543 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,550 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 165 treesize of output 141 [2023-11-29 04:47:14,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:14,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:47:14,590 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 04:47:14,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-11-29 04:47:14,604 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 04:47:14,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2023-11-29 04:47:14,617 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 04:47:14,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2023-11-29 04:47:14,622 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:47:14,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 04:47:14,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:47:14,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 04:47:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:23,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:23,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530961721] [2023-11-29 04:47:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530961721] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:47:23,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:47:23,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-11-29 04:47:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950002302] [2023-11-29 04:47:23,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:23,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 04:47:23,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:23,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 04:47:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=353, Unknown=37, NotChecked=220, Total=702 [2023-11-29 04:47:23,273 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:47:27,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:29,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:33,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:36,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:40,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:43,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:44,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:48,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:50,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:54,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:58,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:47:59,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:02,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:06,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:07,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:11,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:15,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:20,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:22,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:23,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:24,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:28,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:33,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:35,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:39,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:43,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:49,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:48:51,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:00,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:11,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:15,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:22,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:26,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:35,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:42,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:47,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:49:56,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:00,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:05,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:12,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:16,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:20,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:27,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:28,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:36,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:40,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:44,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:46,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:49,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:51,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:54,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:50:58,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:00,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:03,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:07,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:08,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:19,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:23,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:25,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:29,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:33,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:39,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:42,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:45,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:51:49,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]