./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-buckets-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_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:44:13,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:44:13,655 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:44:13,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:44:13,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:44:13,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:44:13,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:44:13,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:44:13,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:44:13,691 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:44:13,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:44:13,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:44:13,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:44:13,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:44:13,693 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:44:13,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:44:13,694 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:44:13,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:44:13,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:44:13,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:44:13,696 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:44:13,697 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:44:13,697 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:44:13,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:44:13,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:44:13,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:44:13,699 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:44:13,699 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:44:13,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:44:13,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:44:13,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:44:13,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:44:13,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:44:13,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:44:13,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:44:13,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:44:13,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:44:13,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:44:13,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:44:13,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:44:13,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:44:13,705 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_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2023-11-29 03:44:13,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:44:13,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:44:13,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:44:13,975 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:44:13,976 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:44:13,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-11-29 03:44:16,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:44:16,895 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:44:16,895 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-11-29 03:44:16,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data/a08ac28f7/06bde4879a8c49379502ac5950ecb05a/FLAG0291abaac [2023-11-29 03:44:16,919 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data/a08ac28f7/06bde4879a8c49379502ac5950ecb05a [2023-11-29 03:44:16,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:44:16,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:44:16,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:44:16,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:44:16,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:44:16,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:44:16" (1/1) ... [2023-11-29 03:44:16,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df01f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:16, skipping insertion in model container [2023-11-29 03:44:16,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:44:16" (1/1) ... [2023-11-29 03:44:16,980 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:44:17,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:44:17,246 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:44:17,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:44:17,321 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:44:17,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17 WrapperNode [2023-11-29 03:44:17,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:44:17,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:44:17,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:44:17,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:44:17,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,369 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 163 [2023-11-29 03:44:17,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:44:17,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:44:17,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:44:17,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:44:17,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,403 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2023-11-29 03:44:17,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:44:17,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:44:17,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:44:17,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:44:17,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (1/1) ... [2023-11-29 03:44:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:44:17,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:44:17,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:44:17,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:44:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 03:44:17,497 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 03:44:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:44:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:44:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:44:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:44:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:44:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:44:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:44:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:44:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:44:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:44:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:44:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:44:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:44:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:44:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:44:17,629 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:44:17,631 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:44:18,056 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:44:18,103 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:44:18,104 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-29 03:44:18,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:44:18 BoogieIcfgContainer [2023-11-29 03:44:18,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:44:18,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:44:18,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:44:18,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:44:18,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:44:16" (1/3) ... [2023-11-29 03:44:18,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98241ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:44:18, skipping insertion in model container [2023-11-29 03:44:18,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:17" (2/3) ... [2023-11-29 03:44:18,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98241ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:44:18, skipping insertion in model container [2023-11-29 03:44:18,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:44:18" (3/3) ... [2023-11-29 03:44:18,115 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2023-11-29 03:44:18,135 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:44:18,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2023-11-29 03:44:18,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:44:18,192 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;@240e8bdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:44:18,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2023-11-29 03:44:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 69 states have (on average 2.4057971014492754) internal successors, (166), 137 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 03:44:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:44:18,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:18,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:44:18,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:18,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 10956, now seen corresponding path program 1 times [2023-11-29 03:44:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877323753] [2023-11-29 03:44:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,393 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 03:44:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877323753] [2023-11-29 03:44:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877323753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:18,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:18,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:44:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712839765] [2023-11-29 03:44:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:18,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:18,429 INFO L87 Difference]: Start difference. First operand has 144 states, 69 states have (on average 2.4057971014492754) internal successors, (166), 137 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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 03:44:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:18,614 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2023-11-29 03:44:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:18,616 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 03:44:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:18,626 INFO L225 Difference]: With dead ends: 166 [2023-11-29 03:44:18,626 INFO L226 Difference]: Without dead ends: 165 [2023-11-29 03:44:18,628 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 03:44:18,632 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 121 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:18,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 102 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-29 03:44:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 132. [2023-11-29 03:44:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 63 states have (on average 2.1904761904761907) internal successors, (138), 130 states have internal predecessors, (138), 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 03:44:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2023-11-29 03:44:18,678 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 2 [2023-11-29 03:44:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:18,679 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2023-11-29 03:44:18,679 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 03:44:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2023-11-29 03:44:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:44:18,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:18,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:44:18,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:44:18,681 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:18,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash 10957, now seen corresponding path program 1 times [2023-11-29 03:44:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355045631] [2023-11-29 03:44:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,773 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 03:44:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355045631] [2023-11-29 03:44:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355045631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:44:18,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763163924] [2023-11-29 03:44:18,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:18,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:18,777 INFO L87 Difference]: Start difference. First operand 132 states and 143 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 03:44:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:18,913 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2023-11-29 03:44:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:18,914 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 03:44:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:18,915 INFO L225 Difference]: With dead ends: 164 [2023-11-29 03:44:18,916 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 03:44:18,916 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 03:44:18,917 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 59 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:18,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 166 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:18,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 03:44:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 128. [2023-11-29 03:44:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 63 states have (on average 2.126984126984127) internal successors, (134), 126 states have internal predecessors, (134), 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 03:44:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2023-11-29 03:44:18,930 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 2 [2023-11-29 03:44:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:18,930 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2023-11-29 03:44:18,930 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 03:44:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2023-11-29 03:44:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:44:18,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:18,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:44:18,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:44:18,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:18,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1537122341, now seen corresponding path program 1 times [2023-11-29 03:44:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:18,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382896637] [2023-11-29 03:44:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:19,102 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 03:44:19,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:19,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382896637] [2023-11-29 03:44:19,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382896637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:19,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:44:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231881037] [2023-11-29 03:44:19,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:19,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:19,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:19,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:19,106 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:19,344 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2023-11-29 03:44:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:44:19,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:44:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:19,346 INFO L225 Difference]: With dead ends: 132 [2023-11-29 03:44:19,346 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 03:44:19,347 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 03:44:19,348 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:19,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 199 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 03:44:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2023-11-29 03:44:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 123 states have internal predecessors, (139), 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 03:44:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2023-11-29 03:44:19,358 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 6 [2023-11-29 03:44:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:19,358 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2023-11-29 03:44:19,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2023-11-29 03:44:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:44:19,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:19,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:44:19,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:44:19,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:19,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1537122342, now seen corresponding path program 1 times [2023-11-29 03:44:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:19,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528173006] [2023-11-29 03:44:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:19,560 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 03:44:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528173006] [2023-11-29 03:44:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528173006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:44:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403563700] [2023-11-29 03:44:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:19,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:19,562 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:19,755 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2023-11-29 03:44:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:44:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:44:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:19,757 INFO L225 Difference]: With dead ends: 121 [2023-11-29 03:44:19,757 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 03:44:19,757 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 03:44:19,758 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:19,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 295 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 03:44:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-29 03:44:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 119 states have internal predecessors, (135), 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 03:44:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2023-11-29 03:44:19,767 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 6 [2023-11-29 03:44:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:19,767 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2023-11-29 03:44:19,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2023-11-29 03:44:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:44:19,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:19,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:19,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:44:19,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:19,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash 769396375, now seen corresponding path program 1 times [2023-11-29 03:44:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:19,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351844108] [2023-11-29 03:44:19,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:19,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:19,910 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 03:44:19,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351844108] [2023-11-29 03:44:19,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351844108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:19,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:19,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:44:19,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61201303] [2023-11-29 03:44:19,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:19,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:19,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:19,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:19,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:19,912 INFO L87 Difference]: Start difference. First operand 121 states and 140 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 03:44:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:20,114 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2023-11-29 03:44:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:44:20,114 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 03:44:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:20,116 INFO L225 Difference]: With dead ends: 127 [2023-11-29 03:44:20,116 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 03:44:20,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:44:20,117 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:20,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 193 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 03:44:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2023-11-29 03:44:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 118 states have internal predecessors, (134), 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 03:44:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2023-11-29 03:44:20,124 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 10 [2023-11-29 03:44:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:20,125 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2023-11-29 03:44:20,125 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 03:44:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2023-11-29 03:44:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:44:20,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:20,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:20,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:44:20,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:20,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash 769396376, now seen corresponding path program 1 times [2023-11-29 03:44:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850155483] [2023-11-29 03:44:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:20,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:20,346 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 03:44:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850155483] [2023-11-29 03:44:20,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850155483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:20,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:20,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:44:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337460845] [2023-11-29 03:44:20,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:20,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:20,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:20,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:20,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:20,348 INFO L87 Difference]: Start difference. First operand 120 states and 139 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 03:44:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:20,505 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2023-11-29 03:44:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:44:20,506 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 03:44:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:20,507 INFO L225 Difference]: With dead ends: 120 [2023-11-29 03:44:20,507 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 03:44:20,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:20,508 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:20,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 283 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 03:44:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2023-11-29 03:44:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 115 states have internal predecessors, (131), 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 03:44:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2023-11-29 03:44:20,514 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 10 [2023-11-29 03:44:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:20,515 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2023-11-29 03:44:20,515 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 03:44:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2023-11-29 03:44:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:44:20,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:20,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:20,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:44:20,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:20,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash 41858133, now seen corresponding path program 1 times [2023-11-29 03:44:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853627858] [2023-11-29 03:44:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:20,658 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 03:44:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853627858] [2023-11-29 03:44:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853627858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:44:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797774787] [2023-11-29 03:44:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:20,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:20,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:20,660 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:20,752 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2023-11-29 03:44:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:20,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 03:44:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:20,754 INFO L225 Difference]: With dead ends: 122 [2023-11-29 03:44:20,754 INFO L226 Difference]: Without dead ends: 122 [2023-11-29 03:44:20,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:20,755 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:20,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-29 03:44:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2023-11-29 03:44:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 110 states have internal predecessors, (126), 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 03:44:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2023-11-29 03:44:20,761 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 15 [2023-11-29 03:44:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:20,761 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2023-11-29 03:44:20,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2023-11-29 03:44:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:44:20,762 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:20,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:20,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:44:20,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:20,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash 41858132, now seen corresponding path program 1 times [2023-11-29 03:44:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279111081] [2023-11-29 03:44:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:20,840 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 03:44:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279111081] [2023-11-29 03:44:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279111081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:20,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:44:20,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681222074] [2023-11-29 03:44:20,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:20,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:20,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:20,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:20,842 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:20,922 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2023-11-29 03:44:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 03:44:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:20,924 INFO L225 Difference]: With dead ends: 117 [2023-11-29 03:44:20,924 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:44:20,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:20,925 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 54 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:20,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 115 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:44:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2023-11-29 03:44:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.704225352112676) internal successors, (121), 105 states have internal predecessors, (121), 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 03:44:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2023-11-29 03:44:20,930 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 15 [2023-11-29 03:44:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:20,930 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2023-11-29 03:44:20,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2023-11-29 03:44:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:44:20,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:20,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:20,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:44:20,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:20,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1571038946, now seen corresponding path program 1 times [2023-11-29 03:44:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:20,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499495606] [2023-11-29 03:44:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,051 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 03:44:21,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:21,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499495606] [2023-11-29 03:44:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499495606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:21,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:21,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:44:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620853126] [2023-11-29 03:44:21,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:21,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:21,053 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:21,239 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2023-11-29 03:44:21,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:44:21,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:44:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:21,244 INFO L225 Difference]: With dead ends: 151 [2023-11-29 03:44:21,244 INFO L226 Difference]: Without dead ends: 151 [2023-11-29 03:44:21,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:44:21,245 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 184 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:21,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 130 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-29 03:44:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 113. [2023-11-29 03:44:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 111 states have internal predecessors, (132), 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 03:44:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2023-11-29 03:44:21,249 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 17 [2023-11-29 03:44:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:21,250 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2023-11-29 03:44:21,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2023-11-29 03:44:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:44:21,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:21,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:21,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:44:21,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:21,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1571038947, now seen corresponding path program 1 times [2023-11-29 03:44:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033007356] [2023-11-29 03:44:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,456 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 03:44:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033007356] [2023-11-29 03:44:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033007356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:44:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95596815] [2023-11-29 03:44:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:21,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:44:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:44:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:44:21,458 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:21,767 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2023-11-29 03:44:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:44:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:44:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:21,769 INFO L225 Difference]: With dead ends: 194 [2023-11-29 03:44:21,769 INFO L226 Difference]: Without dead ends: 194 [2023-11-29 03:44:21,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:44:21,770 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 318 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:21,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 175 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-29 03:44:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2023-11-29 03:44:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 110 states have (on average 1.6727272727272726) internal successors, (184), 144 states have internal predecessors, (184), 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 03:44:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2023-11-29 03:44:21,776 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 17 [2023-11-29 03:44:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:21,776 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2023-11-29 03:44:21,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2023-11-29 03:44:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:44:21,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:21,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:21,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:44:21,778 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:21,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1457568018, now seen corresponding path program 1 times [2023-11-29 03:44:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981384948] [2023-11-29 03:44:21,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,839 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 03:44:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:21,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981384948] [2023-11-29 03:44:21,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981384948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:21,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:21,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:44:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086536061] [2023-11-29 03:44:21,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:21,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:44:21,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:21,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:44:21,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:44:21,841 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 03:44:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:21,950 INFO L93 Difference]: Finished difference Result 181 states and 218 transitions. [2023-11-29 03:44:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:44:21,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-29 03:44:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:21,952 INFO L225 Difference]: With dead ends: 181 [2023-11-29 03:44:21,952 INFO L226 Difference]: Without dead ends: 181 [2023-11-29 03:44:21,952 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 03:44:21,953 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 165 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:21,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 180 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-29 03:44:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 145. [2023-11-29 03:44:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 143 states have internal predecessors, (181), 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 03:44:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2023-11-29 03:44:21,958 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 18 [2023-11-29 03:44:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:21,959 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2023-11-29 03:44:21,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 03:44:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2023-11-29 03:44:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:44:21,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:21,960 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] [2023-11-29 03:44:21,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:44:21,960 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:21,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 566047051, now seen corresponding path program 1 times [2023-11-29 03:44:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786380557] [2023-11-29 03:44:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:22,672 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 03:44:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:22,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786380557] [2023-11-29 03:44:22,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786380557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:22,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:22,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 03:44:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753444270] [2023-11-29 03:44:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:22,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:44:22,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:22,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:44:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:44:22,674 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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 03:44:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:23,282 INFO L93 Difference]: Finished difference Result 178 states and 214 transitions. [2023-11-29 03:44:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:44:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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 03:44:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:23,284 INFO L225 Difference]: With dead ends: 178 [2023-11-29 03:44:23,284 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 03:44:23,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:44:23,285 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 270 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:23,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 457 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:44:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 03:44:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 151. [2023-11-29 03:44:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 149 states have internal predecessors, (185), 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 03:44:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 188 transitions. [2023-11-29 03:44:23,291 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 188 transitions. Word has length 20 [2023-11-29 03:44:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:23,291 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 188 transitions. [2023-11-29 03:44:23,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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 03:44:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 188 transitions. [2023-11-29 03:44:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:44:23,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:23,292 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] [2023-11-29 03:44:23,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:44:23,293 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:23,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1573212541, now seen corresponding path program 1 times [2023-11-29 03:44:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023889366] [2023-11-29 03:44:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,343 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 03:44:23,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:23,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023889366] [2023-11-29 03:44:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023889366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:23,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:44:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80153474] [2023-11-29 03:44:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:23,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:23,346 INFO L87 Difference]: Start difference. First operand 151 states and 188 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 03:44:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:23,389 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2023-11-29 03:44:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:23,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2023-11-29 03:44:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:23,390 INFO L225 Difference]: With dead ends: 150 [2023-11-29 03:44:23,390 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 03:44:23,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:23,391 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:23,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:44:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 03:44:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-29 03:44:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 148 states have internal predecessors, (184), 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 03:44:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2023-11-29 03:44:23,396 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 24 [2023-11-29 03:44:23,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:23,396 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2023-11-29 03:44:23,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 03:44:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2023-11-29 03:44:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:44:23,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:23,398 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 03:44:23,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:44:23,398 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:23,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2060682207, now seen corresponding path program 1 times [2023-11-29 03:44:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548211334] [2023-11-29 03:44:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,475 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 03:44:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548211334] [2023-11-29 03:44:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548211334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:23,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:44:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876025922] [2023-11-29 03:44:23,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:23,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:44:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:23,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:44:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:44:23,477 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 03:44:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:23,587 INFO L93 Difference]: Finished difference Result 182 states and 213 transitions. [2023-11-29 03:44:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:44:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-29 03:44:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:23,589 INFO L225 Difference]: With dead ends: 182 [2023-11-29 03:44:23,589 INFO L226 Difference]: Without dead ends: 182 [2023-11-29 03:44:23,590 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 03:44:23,590 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 152 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:23,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 179 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-29 03:44:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2023-11-29 03:44:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.5630252100840336) internal successors, (186), 150 states have internal predecessors, (186), 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 03:44:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2023-11-29 03:44:23,596 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 25 [2023-11-29 03:44:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:23,596 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2023-11-29 03:44:23,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 03:44:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2023-11-29 03:44:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:44:23,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:23,597 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] [2023-11-29 03:44:23,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:44:23,598 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:23,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1772464190, now seen corresponding path program 1 times [2023-11-29 03:44:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821878643] [2023-11-29 03:44:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:44:24,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821878643] [2023-11-29 03:44:24,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821878643] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:44:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077218779] [2023-11-29 03:44:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:24,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:44:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:44:24,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:44:24,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:44:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:24,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 03:44:24,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:44:24,592 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 03:44:24,632 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 03:44:24,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 03:44:24,672 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 03:44:24,706 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 03:44:24,723 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 03:44:24,745 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:44:24,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 03:44:24,823 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 03:44:25,023 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:44:25,024 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 62 treesize of output 51 [2023-11-29 03:44:25,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-29 03:44:25,170 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:44:25,170 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 71 treesize of output 58 [2023-11-29 03:44:25,248 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:44:25,249 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 71 treesize of output 58 [2023-11-29 03:44:25,352 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-29 03:44:25,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-11-29 03:44:25,424 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 25 [2023-11-29 03:44:25,467 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 25 [2023-11-29 03:44:25,761 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 33 treesize of output 17 [2023-11-29 03:44:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:44:25,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:44:26,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:26,336 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 27 treesize of output 31 [2023-11-29 03:44:27,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:27,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-11-29 03:44:27,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:44:27,365 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:44:27,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:27,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2023-11-29 03:44:27,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:27,389 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 68 treesize of output 64 [2023-11-29 03:44:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:44:28,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077218779] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:44:28,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:44:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 35 [2023-11-29 03:44:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106027533] [2023-11-29 03:44:28,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:44:28,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 03:44:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 03:44:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1126, Unknown=12, NotChecked=0, Total=1332 [2023-11-29 03:44:28,577 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 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 03:44:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:35,705 INFO L93 Difference]: Finished difference Result 195 states and 226 transitions. [2023-11-29 03:44:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 03:44:35,706 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 03:44:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:35,707 INFO L225 Difference]: With dead ends: 195 [2023-11-29 03:44:35,707 INFO L226 Difference]: Without dead ends: 195 [2023-11-29 03:44:35,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=582, Invalid=2596, Unknown=14, NotChecked=0, Total=3192 [2023-11-29 03:44:35,709 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 504 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 100 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:35,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 882 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1437 Invalid, 5 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 03:44:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-29 03:44:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2023-11-29 03:44:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.5666666666666667) internal successors, (188), 151 states have internal predecessors, (188), 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 03:44:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2023-11-29 03:44:35,714 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 27 [2023-11-29 03:44:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:35,714 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2023-11-29 03:44:35,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 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 03:44:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2023-11-29 03:44:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:44:35,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:35,715 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] [2023-11-29 03:44:35,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:44:35,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 03:44:35,919 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:35,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1772464191, now seen corresponding path program 1 times [2023-11-29 03:44:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030960571] [2023-11-29 03:44:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:44:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030960571] [2023-11-29 03:44:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030960571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:44:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266940998] [2023-11-29 03:44:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:37,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:44:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:44:37,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:44:37,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:44:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:37,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 03:44:37,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:44:37,189 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 03:44:37,200 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 03:44:37,233 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 03:44:37,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:44:37,243 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 03:44:37,278 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 03:44:37,285 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 03:44:37,317 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 03:44:37,356 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 03:44:37,369 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 03:44:37,391 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:44:37,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 03:44:37,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:44:37,458 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 03:44:37,509 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 25 treesize of output 13 [2023-11-29 03:44:37,564 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 03:44:37,580 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 03:44:37,602 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 03:44:37,705 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 03:44:37,705 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 03:44:37,752 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 03:44:37,772 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 21 treesize of output 20 [2023-11-29 03:44:37,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:37,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2023-11-29 03:44:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:44:38,067 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:44:38,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266940998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:38,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:44:38,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [13] total 28 [2023-11-29 03:44:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351699698] [2023-11-29 03:44:38,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:38,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:44:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:44:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2023-11-29 03:44:38,070 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:39,359 INFO L93 Difference]: Finished difference Result 254 states and 302 transitions. [2023-11-29 03:44:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:44:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 03:44:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:39,360 INFO L225 Difference]: With dead ends: 254 [2023-11-29 03:44:39,360 INFO L226 Difference]: Without dead ends: 253 [2023-11-29 03:44:39,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 03:44:39,362 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 350 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:39,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 732 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:44:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-29 03:44:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 171. [2023-11-29 03:44:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.5144927536231885) internal successors, (209), 169 states have internal predecessors, (209), 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 03:44:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-11-29 03:44:39,368 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 27 [2023-11-29 03:44:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:39,369 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-11-29 03:44:39,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:44:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-11-29 03:44:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:44:39,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:39,370 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] [2023-11-29 03:44:39,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 03:44:39,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 03:44:39,575 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:44:39,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1816383173, now seen corresponding path program 1 times [2023-11-29 03:44:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963908085] [2023-11-29 03:44:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:40,220 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 03:44:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963908085] [2023-11-29 03:44:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963908085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:44:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630555666] [2023-11-29 03:44:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:44:40,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:44:40,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:44:40,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:44:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:40,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 03:44:40,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:44:40,404 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 03:44:40,423 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:44:40,423 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 03:44:40,437 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 03:44:40,473 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 03:44:40,494 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 03:44:40,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:44:40,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:44:40,526 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 03:44:40,613 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:44:40,613 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 49 treesize of output 44 [2023-11-29 03:44:40,625 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 03:44:40,701 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:44:40,701 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 58 treesize of output 51 [2023-11-29 03:44:40,760 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:44:40,760 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 58 treesize of output 51 [2023-11-29 03:44:40,857 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-11-29 03:44:40,857 INFO L378 Elim1Store]: Elim1 eliminated variable 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 31 treesize of output 32 [2023-11-29 03:44:41,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:41,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 03:44:41,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:44:41,087 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 03:44:41,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:44:41,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:41,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2023-11-29 03:44:41,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:41,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 137 [2023-11-29 03:44:41,959 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 03:44:41,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 03:44:41,984 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 03:44:41,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 03:44:42,105 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:44:42,106 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 2 case distinctions, treesize of input 46 treesize of output 26 [2023-11-29 03:44:42,143 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 Int) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_prenex_5 (Array Int Int)) (v_DerPreprocessor_1 Int)) (let ((.cse2 (store v_arrayElimArr_4 v_prenex_4 v_DerPreprocessor_5)) (.cse0 (select v_arrayElimArr_4 v_prenex_4))) (let ((.cse1 (store (store .cse2 |ULTIMATE.start_main_~bcki~0#1.offset| v_DerPreprocessor_1) v_prenex_6 .cse0))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_3) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= v_DerPreprocessor_1 (select .cse1 |ULTIMATE.start_main_~bcki~0#1.offset|))) (not (= (store (store v_arrayElimArr_4 v_prenex_4 (select .cse1 v_prenex_4)) v_prenex_6 .cse0) .cse1)) (< v_prenex_3 0) (not (= (select |c_#valid| .cse0) 0)) (not (= (select (store .cse2 |ULTIMATE.start_main_~bcki~0#1.offset| .cse0) v_prenex_4) v_DerPreprocessor_5)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_3))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_5)) (.cse4 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store .cse3 .cse4 v_prenex_2) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_1))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_84| Int) (v_ArrVal_1113 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_84|) (not (= (select (select (store .cse3 .cse4 v_ArrVal_1113) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_84|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_84| 0))) (not (= (select |c_#valid| .cse4) 0)) (forall ((v_prenex_6 Int) (v_DerPreprocessor_3 Int)) (not (= v_DerPreprocessor_3 (select (store (store v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset| v_DerPreprocessor_3) v_prenex_6 .cse4) |ULTIMATE.start_main_~bcki~0#1.offset|))))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_3 v_prenex_6))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_7) (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_3) .cse5 v_prenex_8) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_7)) (not (= (select |c_#valid| .cse5) 0)) (< v_prenex_7 0))))) is different from false [2023-11-29 03:44:42,322 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_5)) (.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_84| Int) (v_ArrVal_1113 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_84|) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_84| 0) (not (= (select (select (store .cse1 .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_84|) |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_3 Int)) (not (= v_DerPreprocessor_3 (select (store (store v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset| v_DerPreprocessor_3) v_prenex_6 .cse0) |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (= .cse2 (select (select (store .cse1 .cse0 v_prenex_2) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_1)))))) (forall ((v_prenex_6 Int) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_prenex_5 (Array Int Int)) (v_DerPreprocessor_1 Int)) (let ((.cse5 (store v_arrayElimArr_4 v_prenex_4 v_DerPreprocessor_5)) (.cse4 (select v_arrayElimArr_4 v_prenex_4))) (let ((.cse3 (store (store .cse5 |ULTIMATE.start_main_~bcki~0#1.offset| v_DerPreprocessor_1) v_prenex_6 .cse4))) (or (not (= v_DerPreprocessor_1 (select .cse3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (not (= (store (store v_arrayElimArr_4 v_prenex_4 (select .cse3 v_prenex_4)) v_prenex_6 .cse4) .cse3)) (< v_prenex_3 0) (not (= (select |c_#valid| .cse4) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_3) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= (select (store .cse5 |ULTIMATE.start_main_~bcki~0#1.offset| .cse4) v_prenex_4) v_DerPreprocessor_5)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_3))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 v_prenex_6))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_7) (= .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_3) .cse6 v_prenex_8) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_7)) (not (= (select |c_#valid| .cse6) 0)) (< v_prenex_7 0)))))) is different from false [2023-11-29 03:44:42,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:42,376 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 221 treesize of output 198 [2023-11-29 03:44:42,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:42,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 518 treesize of output 570 [2023-11-29 03:44:42,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:42,567 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 350 treesize of output 351 [2023-11-29 03:44:42,600 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 321 treesize of output 317 [2023-11-29 03:44:42,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 317 treesize of output 313 [2023-11-29 03:44:42,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:42,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 320 treesize of output 368 [2023-11-29 03:44:42,776 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 303 treesize of output 299 [2023-11-29 03:44:43,049 INFO L349 Elim1Store]: treesize reduction 236, result has 29.3 percent of original size [2023-11-29 03:44:43,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 421 treesize of output 521 [2023-11-29 03:44:43,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 292 [2023-11-29 03:44:43,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:44:43,228 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 325 treesize of output 321 [2023-11-29 03:46:43,419 INFO L349 Elim1Store]: treesize reduction 180, result has 47.2 percent of original size [2023-11-29 03:46:43,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 965 treesize of output 1194 [2023-11-29 03:46:48,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,625 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 03:46:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 121 [2023-11-29 03:46:48,726 INFO L349 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2023-11-29 03:46:48,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 121 [2023-11-29 03:46:48,817 INFO L349 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2023-11-29 03:46:48,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 121 [2023-11-29 03:46:48,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,905 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 03:46:48,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 121 [2023-11-29 03:46:48,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:48,949 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 03:46:48,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 121 [2023-11-29 03:46:49,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,051 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-29 03:46:49,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 121 [2023-11-29 03:46:49,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:49,363 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-29 03:46:49,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 121 [2023-11-29 03:46:50,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:50,590 INFO L349 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2023-11-29 03:46:50,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 571 treesize of output 577 [2023-11-29 03:46:50,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:50,859 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:46:50,859 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 134 treesize of output 113 [2023-11-29 03:46:50,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:50,895 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:46:50,895 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 130 treesize of output 109 [2023-11-29 03:46:50,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:50,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:50,936 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 0 case distinctions, treesize of input 98 treesize of output 77 [2023-11-29 03:46:51,070 INFO L349 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2023-11-29 03:46:51,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 423 [2023-11-29 03:46:51,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:51,255 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 0 case distinctions, treesize of input 28 treesize of output 6 [2023-11-29 03:46:51,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:51,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:51,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:51,325 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 1 case distinctions, treesize of input 355 treesize of output 340 [2023-11-29 03:46:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:51,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:51,527 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 0 case distinctions, treesize of input 98 treesize of output 77 [2023-11-29 03:46:52,727 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:46:52,728 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 1063 treesize of output 963 [2023-11-29 03:46:52,875 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 03:46:52,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630555666] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:52,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:46:52,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 28 [2023-11-29 03:46:52,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719480388] [2023-11-29 03:46:52,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:52,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 03:46:52,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:52,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 03:46:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=651, Unknown=9, NotChecked=106, Total=870 [2023-11-29 03:46:52,878 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:54,805 INFO L93 Difference]: Finished difference Result 211 states and 244 transitions. [2023-11-29 03:46:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 03:46:54,806 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:46:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:54,807 INFO L225 Difference]: With dead ends: 211 [2023-11-29 03:46:54,807 INFO L226 Difference]: Without dead ends: 211 [2023-11-29 03:46:54,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=289, Invalid=1432, Unknown=9, NotChecked=162, Total=1892 [2023-11-29 03:46:54,809 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 265 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:54,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 928 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1406 Invalid, 0 Unknown, 342 Unchecked, 1.2s Time] [2023-11-29 03:46:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-29 03:46:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2023-11-29 03:46:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.4965986394557824) internal successors, (220), 178 states have internal predecessors, (220), 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 03:46:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 222 transitions. [2023-11-29 03:46:54,814 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 222 transitions. Word has length 28 [2023-11-29 03:46:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:54,815 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 222 transitions. [2023-11-29 03:46:54,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2023-11-29 03:46:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:46:54,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:54,816 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] [2023-11-29 03:46:54,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:46:55,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 03:46:55,016 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:46:55,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1816383174, now seen corresponding path program 1 times [2023-11-29 03:46:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292009084] [2023-11-29 03:46:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:55,773 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 03:46:55,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:55,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292009084] [2023-11-29 03:46:55,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292009084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:46:55,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796353878] [2023-11-29 03:46:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:55,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:46:55,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:46:55,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:46:55,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:46:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:55,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 03:46:55,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:55,926 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 03:46:55,985 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:46:55,986 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 03:46:56,035 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 03:46:56,039 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 03:46:56,142 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:46:56,142 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:46:56,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:56,154 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 03:46:56,214 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:46:56,215 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:46:56,239 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:46:56,239 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 03:46:56,259 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:46:56,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 03:46:56,282 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 03:46:56,282 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 03:46:56,356 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:46:56,356 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 03:46:56,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:46:56,370 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 03:46:56,503 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:46:56,503 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 67 treesize of output 50 [2023-11-29 03:46:56,526 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:46:56,526 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:46:56,585 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:46:56,585 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 67 treesize of output 50 [2023-11-29 03:46:56,610 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:46:56,610 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:46:56,675 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 03:46:56,675 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 03:46:56,681 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 03:46:56,908 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-29 03:46:56,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2023-11-29 03:46:56,940 INFO L349 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2023-11-29 03:46:56,940 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 61 treesize of output 52 [2023-11-29 03:46:57,330 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 03:46:57,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 29 [2023-11-29 03:46:57,335 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 03:46:57,354 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 03:46:57,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:57,663 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 0) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1267) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1266) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_89|))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_89|))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_ArrVal_1267 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1267) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_89|) 5)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)))) is different from false [2023-11-29 03:46:57,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:57,955 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 63 treesize of output 67 [2023-11-29 03:46:57,979 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 26 treesize of output 22 [2023-11-29 03:46:58,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,127 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 137 treesize of output 141 [2023-11-29 03:46:58,204 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 26 treesize of output 22 [2023-11-29 03:46:58,308 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_142 Int) (v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_prenex_172 Int)) (or (not (= 0 (select |c_#valid| v_arrayElimCell_142))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_172) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_174) v_arrayElimCell_142 v_prenex_173) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_172) 5) (< v_prenex_172 0))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_ArrVal_1267 (Array Int Int)) (v_arrayElimCell_139 Int) (v_ArrVal_1261 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 0) (not (= (select |c_#valid| v_arrayElimCell_139) 0)) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1261) v_arrayElimCell_139 v_ArrVal_1267) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_89|))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_89|))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_172 Int)) (or (forall ((v_arrayElimArr_17 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1266 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse0 v_ArrVal_1266) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_172) |c_ULTIMATE.start_main_~bcki~0#1.base|)) (not (= (select |c_#valid| .cse0) 0))))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_172) (< v_prenex_172 0))) (< |ULTIMATE.start_main_~bcki~0#1.offset| 0))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_172 Int)) (or (forall ((v_arrayElimArr_17 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1266 (Array Int Int))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse1 v_ArrVal_1266) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_172)))) (not (= (select |c_#valid| .cse1) 0))))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_172) (< v_prenex_172 0))) (< |ULTIMATE.start_main_~bcki~0#1.offset| 0)))) is different from false [2023-11-29 03:46:58,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_172 Int)) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_172) (< v_prenex_172 0) (forall ((v_arrayElimArr_17 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1266 (Array Int Int))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_arrayElimArr_17) .cse0 v_ArrVal_1266) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_172)))) (not (= (select |c_#valid| .cse0) 0))))))) (< |ULTIMATE.start_main_~bcki~0#1.offset| 0))) (forall ((v_arrayElimCell_142 Int) (v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_prenex_172 Int)) (or (not (= 0 (select |c_#valid| v_arrayElimCell_142))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_172) (< v_prenex_172 0) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_prenex_174) v_arrayElimCell_142 v_prenex_173) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_172) 5))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_172 Int)) (or (forall ((v_arrayElimArr_17 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select |c_#valid| .cse2) 0)) (forall ((v_ArrVal_1266 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_arrayElimArr_17) .cse2 v_ArrVal_1266) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_172)))))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_172) (< v_prenex_172 0))) (< |ULTIMATE.start_main_~bcki~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_ArrVal_1267 (Array Int Int)) (v_arrayElimCell_139 Int) (v_ArrVal_1261 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1261) v_arrayElimCell_139 v_ArrVal_1267) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_89|) 5)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 0) (not (= (select |c_#valid| v_arrayElimCell_139) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_89|))))) is different from false [2023-11-29 03:46:58,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,429 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 23 treesize of output 24 [2023-11-29 03:46:58,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:46:58,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-11-29 03:46:58,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2023-11-29 03:46:58,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,475 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 23 treesize of output 24 [2023-11-29 03:46:58,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:46:58,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-11-29 03:46:58,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-29 03:46:58,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,514 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 26 treesize of output 27 [2023-11-29 03:46:58,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:46:58,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,523 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 37 treesize of output 37 [2023-11-29 03:46:58,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-11-29 03:46:58,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,581 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 21 treesize of output 22 [2023-11-29 03:46:58,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:46:58,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:58,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-11-29 03:46:58,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-29 03:46:59,002 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 03:46:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796353878] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:59,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:46:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 33 [2023-11-29 03:46:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88726217] [2023-11-29 03:46:59,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:59,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 03:46:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 03:46:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=872, Unknown=4, NotChecked=186, Total=1190 [2023-11-29 03:46:59,005 INFO L87 Difference]: Start difference. First operand 180 states and 222 transitions. Second operand has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:47:02,830 INFO L93 Difference]: Finished difference Result 258 states and 299 transitions. [2023-11-29 03:47:02,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:47:02,831 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:47:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:47:02,832 INFO L225 Difference]: With dead ends: 258 [2023-11-29 03:47:02,832 INFO L226 Difference]: Without dead ends: 258 [2023-11-29 03:47:02,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=382, Invalid=1978, Unknown=4, NotChecked=288, Total=2652 [2023-11-29 03:47:02,834 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 661 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:47:02,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 923 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1490 Invalid, 1 Unknown, 672 Unchecked, 2.3s Time] [2023-11-29 03:47:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-11-29 03:47:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 196. [2023-11-29 03:47:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 166 states have (on average 1.5060240963855422) internal successors, (250), 194 states have internal predecessors, (250), 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 03:47:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 252 transitions. [2023-11-29 03:47:02,840 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 252 transitions. Word has length 28 [2023-11-29 03:47:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:47:02,840 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 252 transitions. [2023-11-29 03:47:02,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2023-11-29 03:47:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:47:02,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:47:02,841 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] [2023-11-29 03:47:02,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:47:03,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:47:03,043 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:47:03,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:47:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2022720760, now seen corresponding path program 1 times [2023-11-29 03:47:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:47:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502646186] [2023-11-29 03:47:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:47:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:47:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:47:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:47:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502646186] [2023-11-29 03:47:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502646186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:47:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326533623] [2023-11-29 03:47:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:47:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:47:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:47:03,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:47:03,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:47:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:47:03,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 03:47:03,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:47:03,980 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 03:47:04,003 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:47:04,003 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 03:47:04,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:47:04,045 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 03:47:04,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 11 treesize of output 7 [2023-11-29 03:47:04,158 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:47:04,158 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:47:04,173 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:47:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable 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 42 treesize of output 31 [2023-11-29 03:47:04,225 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:47:04,225 INFO L378 Elim1Store]: Elim1 eliminated variable 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 42 treesize of output 31 [2023-11-29 03:47:04,240 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:47:04,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-29 03:47:04,272 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-11-29 03:47:04,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 03:47:04,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:47:04,288 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 03:47:04,350 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:47:04,351 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 61 treesize of output 33 [2023-11-29 03:47:04,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:47:04,373 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 03:47:04,508 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:47:04,508 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:47:04,531 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:47:04,531 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 74 treesize of output 55 [2023-11-29 03:47:04,601 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:47:04,602 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 74 treesize of output 55 [2023-11-29 03:47:04,624 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:47:04,624 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:47:04,689 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 03:47:04,689 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 103 treesize of output 76 [2023-11-29 03:47:04,695 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 03:47:04,811 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:47:04,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-29 03:47:04,834 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 03:47:04,834 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 03:47:04,929 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-29 03:47:04,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 49 [2023-11-29 03:47:04,946 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 03:47:05,013 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-29 03:47:05,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 49 [2023-11-29 03:47:05,023 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 03:47:05,248 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:47:05,248 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 03:47:05,253 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 03:47:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:05,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:47:06,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:06,298 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 93 treesize of output 97 [2023-11-29 03:47:06,376 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 51 treesize of output 43 [2023-11-29 03:47:11,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((v_arrayElimArr_22 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (let ((.cse1 (select v_arrayElimArr_22 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1427 Int)) (let ((.cse2 (store |c_#valid| .cse1 v_ArrVal_1427))) (or (forall ((v_prenex_180 (Array Int Int)) (v_ArrVal_1437 (Array Int Int)) (v_prenex_178 Int) (v_ArrVal_1443 (Array Int Int)) (v_prenex_177 Int) (v_prenex_176 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_ArrVal_1426 Int) (v_ArrVal_1439 Int)) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_178) (< v_prenex_178 0) (< (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_179) .cse1 v_prenex_176) v_prenex_177 v_prenex_180) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_178) 11) (select (store (store |c_#length| .cse1 v_ArrVal_1426) v_prenex_177 v_ArrVal_1439) (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_22) .cse1 v_ArrVal_1437) v_prenex_177 v_ArrVal_1443) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_178))) (not (= (select .cse2 v_prenex_177) 0)))) (not (= (select .cse2 .cse0) 1))))) (not (= (select |c_#valid| .cse1) 0))))) (forall ((v_ArrVal_1438 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_53| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1442 (Array Int Int)) (v_arrayElimCell_191 Int) (v_ArrVal_1427 Int)) (let ((.cse3 (store |c_#valid| v_arrayElimCell_191 v_ArrVal_1427))) (or (not (= (select .cse3 .cse0) 1)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_94| 0) (not (= (select |c_#valid| v_arrayElimCell_191) 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_53|) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_94|) (< 0 (+ 9 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1432) v_arrayElimCell_191 v_ArrVal_1438) |v_ULTIMATE.start_main_~item~0#1.base_53| v_ArrVal_1442) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)))))))) is different from false [2023-11-29 03:47:11,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:11,236 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 26 treesize of output 27 [2023-11-29 03:47:11,240 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:47:11,240 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:47:11,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:11,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-11-29 03:47:11,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-29 03:47:11,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:11,294 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 61 treesize of output 62 [2023-11-29 03:47:11,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:11,304 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 53 treesize of output 54 [2023-11-29 03:47:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:47:11,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:47:11,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:11,321 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 84 treesize of output 84 [2023-11-29 03:47:11,328 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:47:11,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:47:11,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:11,340 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 114 treesize of output 110 [2023-11-29 03:47:11,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:47:11,356 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 74 treesize of output 70 [2023-11-29 03:47:11,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-29 03:47:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326533623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:47:16,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:47:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2023-11-29 03:47:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929796920] [2023-11-29 03:47:16,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:47:16,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 03:47:16,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:47:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 03:47:16,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1083, Unknown=10, NotChecked=68, Total=1332 [2023-11-29 03:47:16,382 INFO L87 Difference]: Start difference. First operand 196 states and 252 transitions. Second operand has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 36 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:20,602 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 03:47:24,614 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 03:47:36,869 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 03:47:40,882 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 03:47:44,913 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 03:47:48,926 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 03:48:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:08,224 INFO L93 Difference]: Finished difference Result 415 states and 493 transitions. [2023-11-29 03:48:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 03:48:08,225 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 36 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:48:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:08,227 INFO L225 Difference]: With dead ends: 415 [2023-11-29 03:48:08,227 INFO L226 Difference]: Without dead ends: 415 [2023-11-29 03:48:08,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=665, Invalid=4288, Unknown=21, NotChecked=138, Total=5112 [2023-11-29 03:48:08,229 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1196 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 127 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 29.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:08,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 1431 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2510 Invalid, 11 Unknown, 341 Unchecked, 29.8s Time] [2023-11-29 03:48:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-11-29 03:48:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 259. [2023-11-29 03:48:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 229 states have (on average 1.480349344978166) internal successors, (339), 257 states have internal predecessors, (339), 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 03:48:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 341 transitions. [2023-11-29 03:48:08,236 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 341 transitions. Word has length 28 [2023-11-29 03:48:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:08,236 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 341 transitions. [2023-11-29 03:48:08,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 36 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:48:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 341 transitions. [2023-11-29 03:48:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:48:08,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:08,237 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 03:48:08,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:48:08,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:48:08,437 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:48:08,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash 473304463, now seen corresponding path program 1 times [2023-11-29 03:48:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784636719] [2023-11-29 03:48:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784636719] [2023-11-29 03:48:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784636719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:48:09,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608100947] [2023-11-29 03:48:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:09,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:48:09,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:48:09,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:48:09,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:48:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:09,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 03:48:09,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:48:09,211 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 03:48:09,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:48:09,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:48:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:48:09,331 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:48:09,331 INFO L378 Elim1Store]: Elim1 eliminated variable 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 32 treesize of output 23 [2023-11-29 03:48:09,365 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:48:09,365 INFO L378 Elim1Store]: Elim1 eliminated variable 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 32 treesize of output 23 [2023-11-29 03:48:09,387 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:48:09,387 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 03:48:09,466 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:48:09,467 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 39 treesize of output 19 [2023-11-29 03:48:09,626 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:48:09,626 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 48 treesize of output 43 [2023-11-29 03:48:09,635 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 03:48:09,751 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:48:09,752 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 57 treesize of output 50 [2023-11-29 03:48:09,825 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:48:09,825 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 57 treesize of output 50 [2023-11-29 03:48:09,846 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 16 treesize of output 12 [2023-11-29 03:48:09,988 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-11-29 03:48:09,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-29 03:48:10,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:48:10,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-11-29 03:48:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:10,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:48:10,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:48:10,595 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 17 treesize of output 21 [2023-11-29 03:48:10,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:48:10,824 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 24 treesize of output 25 [2023-11-29 03:48:10,828 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:48:10,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:48:10,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-11-29 03:48:10,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:48:10,857 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 29 treesize of output 33 [2023-11-29 03:48:10,875 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 03:48:10,875 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 12 [2023-11-29 03:48:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608100947] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:48:11,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:48:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 29 [2023-11-29 03:48:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763204929] [2023-11-29 03:48:11,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:48:11,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 03:48:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 03:48:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=712, Unknown=10, NotChecked=0, Total=870 [2023-11-29 03:48:11,118 INFO L87 Difference]: Start difference. First operand 259 states and 341 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:48:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:13,539 INFO L93 Difference]: Finished difference Result 340 states and 427 transitions. [2023-11-29 03:48:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:48:13,539 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 03:48:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:13,542 INFO L225 Difference]: With dead ends: 340 [2023-11-29 03:48:13,542 INFO L226 Difference]: Without dead ends: 340 [2023-11-29 03:48:13,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=318, Invalid=1476, Unknown=12, NotChecked=0, Total=1806 [2023-11-29 03:48:13,543 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 300 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 35 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:13,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 909 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1145 Invalid, 10 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 03:48:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-11-29 03:48:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 259. [2023-11-29 03:48:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 229 states have (on average 1.4759825327510918) internal successors, (338), 257 states have internal predecessors, (338), 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 03:48:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 340 transitions. [2023-11-29 03:48:13,549 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 340 transitions. Word has length 29 [2023-11-29 03:48:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:13,549 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 340 transitions. [2023-11-29 03:48:13,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:48:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 340 transitions. [2023-11-29 03:48:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:48:13,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:13,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:13,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:48:13,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-11-29 03:48:13,755 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:48:13,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash -418424184, now seen corresponding path program 1 times [2023-11-29 03:48:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811612578] [2023-11-29 03:48:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:15,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:15,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811612578] [2023-11-29 03:48:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811612578] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:48:15,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489045730] [2023-11-29 03:48:15,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:15,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:48:15,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:48:15,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:48:15,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:48:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:15,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 03:48:15,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:48:15,603 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 03:48:15,639 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:48:15,639 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 03:48:15,710 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 03:48:15,720 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 03:48:15,771 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 03:48:15,791 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 03:48:15,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 03:48:15,833 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 03:48:15,834 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 03:48:15,847 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 19 treesize of output 18 [2023-11-29 03:48:15,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 03:48:15,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:15,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 03:48:16,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:16,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:16,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:16,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-29 03:48:16,049 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:48:16,050 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 70 treesize of output 49 [2023-11-29 03:48:16,123 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:48:16,123 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 70 treesize of output 49 [2023-11-29 03:48:16,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:16,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:16,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:16,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-29 03:48:16,201 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 03:48:16,201 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 99 treesize of output 70 [2023-11-29 03:48:16,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:48:16,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-29 03:48:16,541 INFO L349 Elim1Store]: treesize reduction 70, result has 31.4 percent of original size [2023-11-29 03:48:16,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 62 [2023-11-29 03:48:16,578 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-29 03:48:16,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2023-11-29 03:48:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:48:17,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:09,725 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((v_ArrVal_1753 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_103| Int) (v_ArrVal_1752 (Array Int Int))) (or (forall ((v_ArrVal_1755 Int)) (= 0 (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1753))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) v_ArrVal_1755)) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1752) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_103|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) 4)))))) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_103| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_103|))) (forall ((v_ArrVal_1753 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_103| Int) (v_ArrVal_1752 (Array Int Int))) (or (= (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1752))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse4 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) 0)) (select .cse4 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|)))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1753) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) 4)) 0) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_103| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_103|))))) is different from false [2023-11-29 03:50:10,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:10,307 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 74 [2023-11-29 03:50:10,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:10,333 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2023-11-29 03:50:10,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:10,395 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 90 [2023-11-29 03:50:10,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:10,421 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 66 [2023-11-29 03:50:12,014 INFO L349 Elim1Store]: treesize reduction 55, result has 54.9 percent of original size [2023-11-29 03:50:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 688 treesize of output 638 [2023-11-29 03:50:12,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:50:12,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:12,059 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 756 treesize of output 712 [2023-11-29 03:50:12,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:12,081 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 706 treesize of output 586 [2023-11-29 03:50:12,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:50:12,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:12,119 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 707 treesize of output 647 [2023-11-29 03:50:12,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:12,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 668 treesize of output 672 [2023-11-29 03:50:12,334 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:50:12,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:12,377 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 647 treesize of output 611 [2023-11-29 03:50:12,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:12,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 495 treesize of output 491 [2023-11-29 03:50:14,384 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 5 treesize of output 3 [2023-11-29 03:50:14,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:50:14,493 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:50:15,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:15,963 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 58 treesize of output 62 [2023-11-29 03:50:16,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:16,116 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 83 treesize of output 84 [2023-11-29 03:50:16,197 INFO L349 Elim1Store]: treesize reduction 43, result has 56.1 percent of original size [2023-11-29 03:50:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1294 treesize of output 984 [2023-11-29 03:50:16,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:50:16,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:16,239 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 688 treesize of output 656 [2023-11-29 03:50:16,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:50:16,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:16,310 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 912 treesize of output 878 [2023-11-29 03:50:16,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:16,383 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 624 treesize of output 612 [2023-11-29 03:50:16,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:16,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 652 treesize of output 662 [2023-11-29 03:50:16,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:16,656 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 245 treesize of output 238 [2023-11-29 03:50:17,279 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 03:50:24,068 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 03:50:24,116 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 03:50:24,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 7 treesize of output 3 [2023-11-29 03:50:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:50:24,251 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 03:50:24,309 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 03:50:24,455 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 03:50:24,507 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 03:50:24,581 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 03:50:24,636 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 03:50:24,726 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 03:50:24,770 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 03:50:24,851 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 03:50:24,897 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 03:50:24,956 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:50:25,006 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:50:25,187 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 03:50:25,238 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 03:50:25,327 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 03:50:25,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 7 treesize of output 3 [2023-11-29 03:50:25,430 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 03:50:25,505 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 03:50:28,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:28,307 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 160 treesize of output 162 [2023-11-29 03:50:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489045730] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:29,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 35 [2023-11-29 03:50:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331175224] [2023-11-29 03:50:29,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:29,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 03:50:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 03:50:29,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1031, Unknown=36, NotChecked=66, Total=1260 [2023-11-29 03:50:29,720 INFO L87 Difference]: Start difference. First operand 259 states and 340 transitions. Second operand has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:51:06,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse8 (select .cse12 .cse15)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse16 (select .cse12 |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.base| .cse16) 4) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 4) 0)) (.cse5 (select .cse6 .cse15)) (.cse4 (= .cse8 0)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse7 (= .cse15 0))) (and .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_103| Int)) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_103| 0) (= 0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse2 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) 0)) (select .cse2 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|)) (+ (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) 4))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_103|))) .cse4 (= .cse5 0) (or (= (select .cse6 0) 0) .cse7) (or (and .cse0 .cse1 .cse4 (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse5)) (and (not .cse4) (= .cse8 |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_103| Int)) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_103| 0) (forall ((v_ArrVal_1755 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse3 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) v_ArrVal_1755)) (select .cse2 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|)) (+ (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_103|) 4)) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_103|))) (= (select .cse6 |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0) (or (let ((.cse9 (select .cse12 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4) 0) (not (= .cse9 .cse10)) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse10)) (= 0 (select .cse11 4)))))) (and (exists ((v_arrayElimIndex_27 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_27))) (let ((.cse14 (select .cse13 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_27) 4) 0) (= (select .cse13 4) 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimIndex_27)) (not (= .cse14 v_arrayElimIndex_27)) (not (= .cse14 |c_ULTIMATE.start_main_~bcki~0#1.base|)))))) .cse7)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0))))) is different from false [2023-11-29 03:51:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:45,118 INFO L93 Difference]: Finished difference Result 288 states and 371 transitions. [2023-11-29 03:51:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 03:51:45,119 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 03:51:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:45,121 INFO L225 Difference]: With dead ends: 288 [2023-11-29 03:51:45,121 INFO L226 Difference]: Without dead ends: 288 [2023-11-29 03:51:45,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 186.8s TimeCoverageRelationStatistics Valid=370, Invalid=2448, Unknown=52, NotChecked=210, Total=3080 [2023-11-29 03:51:45,123 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 411 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:45,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 770 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1168 Invalid, 0 Unknown, 185 Unchecked, 3.6s Time] [2023-11-29 03:51:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-29 03:51:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 261. [2023-11-29 03:51:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 231 states have (on average 1.4718614718614718) internal successors, (340), 259 states have internal predecessors, (340), 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 03:51:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 342 transitions. [2023-11-29 03:51:45,130 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 342 transitions. Word has length 31 [2023-11-29 03:51:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:45,130 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 342 transitions. [2023-11-29 03:51:45,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:51:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 342 transitions. [2023-11-29 03:51:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:51:45,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:45,131 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 03:51:45,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:51:45,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 03:51:45,331 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:51:45,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash -882588665, now seen corresponding path program 1 times [2023-11-29 03:51:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:45,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95874658] [2023-11-29 03:51:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:46,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 03:51:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95874658] [2023-11-29 03:51:46,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95874658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:46,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:51:46,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 03:51:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209751632] [2023-11-29 03:51:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:46,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:51:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:51:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:51:46,672 INFO L87 Difference]: Start difference. First operand 261 states and 342 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:51:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:48,196 INFO L93 Difference]: Finished difference Result 344 states and 435 transitions. [2023-11-29 03:51:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:51:48,196 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 03:51:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:48,199 INFO L225 Difference]: With dead ends: 344 [2023-11-29 03:51:48,199 INFO L226 Difference]: Without dead ends: 344 [2023-11-29 03:51:48,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:51:48,200 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 359 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:48,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 271 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:51:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-29 03:51:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 289. [2023-11-29 03:51:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 259 states have (on average 1.4285714285714286) internal successors, (370), 287 states have internal predecessors, (370), 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 03:51:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 372 transitions. [2023-11-29 03:51:48,209 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 372 transitions. Word has length 31 [2023-11-29 03:51:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:48,209 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 372 transitions. [2023-11-29 03:51:48,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:51:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 372 transitions. [2023-11-29 03:51:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 03:51:48,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:48,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:48,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 03:51:48,210 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:51:48,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2090150748, now seen corresponding path program 1 times [2023-11-29 03:51:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497917232] [2023-11-29 03:51:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:48,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:51:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:49,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497917232] [2023-11-29 03:51:49,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497917232] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:49,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119945105] [2023-11-29 03:51:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:49,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:49,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:49,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:49,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:51:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:49,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 03:51:49,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:49,711 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 03:51:49,754 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:51:49,755 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 03:51:49,829 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 03:51:49,833 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 03:51:49,892 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 03:51:49,907 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 03:51:49,977 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-29 03:51:49,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-29 03:51:50,002 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 03:51:50,010 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 03:51:50,098 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 03:51:50,122 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 23 treesize of output 11 [2023-11-29 03:51:50,425 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:51:50,426 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 94 treesize of output 71 [2023-11-29 03:51:50,453 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:51:50,453 INFO L378 Elim1Store]: Elim1 eliminated variable 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 77 treesize of output 66 [2023-11-29 03:51:50,561 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:51:50,561 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 94 treesize of output 71 [2023-11-29 03:51:50,589 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:51:50,590 INFO L378 Elim1Store]: Elim1 eliminated variable 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 77 treesize of output 66 [2023-11-29 03:51:50,677 INFO L349 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-11-29 03:51:50,678 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 135 treesize of output 104 [2023-11-29 03:51:50,705 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-11-29 03:51:50,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 86 treesize of output 83 [2023-11-29 03:51:50,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:51:50,957 INFO L349 Elim1Store]: treesize reduction 102, result has 37.0 percent of original size [2023-11-29 03:51:50,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 77 [2023-11-29 03:51:51,141 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-29 03:51:51,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 78 [2023-11-29 03:51:51,153 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 78 treesize of output 67 [2023-11-29 03:51:51,366 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-29 03:51:51,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 78 [2023-11-29 03:51:51,376 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 78 treesize of output 67 [2023-11-29 03:51:52,147 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 77 treesize of output 57 [2023-11-29 03:51:52,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:51:52,643 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:51:52,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 37 [2023-11-29 03:51:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:51:52,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:51:53,593 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 48 [2023-11-29 03:51:54,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:54,722 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 76 treesize of output 73 [2023-11-29 03:51:55,122 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1996 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_60| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_109| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse0 (select v_arrayElimArr_36 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.base| .cse5 v_arrayElimArr_36) .cse0 v_ArrVal_1995) |v_ULTIMATE.start_main_~item~0#1.base_60| v_ArrVal_2002))) (let ((.cse1 (store |c_#valid| .cse0 1)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_109|)) (.cse4 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1989) .cse0 v_ArrVal_1996) |v_ULTIMATE.start_main_~item~0#1.base_60| v_ArrVal_2001) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_109|))) (or (not (= (select |c_#valid| .cse0) 0)) (= (select (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_60| 1) (select (select .cse2 .cse3) .cse4)) 1) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_109| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_109|) (not (= (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_60|) 0)) (= .cse3 |v_ULTIMATE.start_main_~item~0#1.base_60|) (< .cse4 0)))))) is different from false [2023-11-29 03:51:55,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:55,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 101 [2023-11-29 03:51:55,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:55,167 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 121 treesize of output 105 [2023-11-29 03:51:55,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:55,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2740 treesize of output 2272 [2023-11-29 03:51:55,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:51:55,229 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:51:56,762 INFO L349 Elim1Store]: treesize reduction 192, result has 67.4 percent of original size [2023-11-29 03:51:56,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 25847 treesize of output 23447 [2023-11-29 03:51:57,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:57,637 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 2195 treesize of output 1941 [2023-11-29 03:51:57,754 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 987 treesize of output 943 [2023-11-29 03:51:58,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:58,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1502 treesize of output 1506 [2023-11-29 03:51:58,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:58,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1446 treesize of output 1394 [2023-11-29 03:51:58,587 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 354 treesize of output 304 [2023-11-29 03:51:58,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 281 treesize of output 235 [2023-11-29 03:53:34,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 03:53:34,853 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:34,855 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 03:53:34,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:53:35,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 03:53:35,056 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_12fdbdde-ede1-455a-a2c2-b6717954f881/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.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) ... 69 more [2023-11-29 03:53:35,058 INFO L158 Benchmark]: Toolchain (without parser) took 558136.33ms. Allocated memory was 151.0MB in the beginning and 406.8MB in the end (delta: 255.9MB). Free memory was 103.5MB in the beginning and 248.5MB in the end (delta: -145.1MB). Peak memory consumption was 254.6MB. Max. memory is 16.1GB. [2023-11-29 03:53:35,058 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:53:35,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.04ms. Allocated memory is still 151.0MB. Free memory was 102.8MB in the beginning and 85.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:53:35,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.03ms. Allocated memory is still 151.0MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:53:35,059 INFO L158 Benchmark]: Boogie Preprocessor took 51.58ms. Allocated memory is still 151.0MB. Free memory was 82.6MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:53:35,059 INFO L158 Benchmark]: RCFGBuilder took 682.08ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 79.8MB in the beginning and 154.9MB in the end (delta: -75.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2023-11-29 03:53:35,059 INFO L158 Benchmark]: TraceAbstraction took 556950.16ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 154.9MB in the beginning and 248.5MB in the end (delta: -93.7MB). Peak memory consumption was 262.8MB. Max. memory is 16.1GB. [2023-11-29 03:53:35,060 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.19ms. Allocated memory is still 151.0MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.04ms. Allocated memory is still 151.0MB. Free memory was 102.8MB in the beginning and 85.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.03ms. Allocated memory is still 151.0MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.58ms. Allocated memory is still 151.0MB. Free memory was 82.6MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 682.08ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 79.8MB in the beginning and 154.9MB in the end (delta: -75.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 556950.16ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 154.9MB in the beginning and 248.5MB in the end (delta: -93.7MB). Peak memory consumption was 262.8MB. 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_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:53:36,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:53:36,893 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:53:36,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:53:36,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:53:36,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:53:36,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:53:36,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:53:36,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:53:36,939 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:53:36,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:53:36,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:53:36,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:53:36,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:53:36,942 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:53:36,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:53:36,944 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:53:36,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:53:36,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:53:36,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:53:36,946 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:53:36,946 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:53:36,947 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:53:36,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:53:36,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:53:36,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:53:36,949 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:53:36,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:53:36,949 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:53:36,950 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:53:36,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:53:36,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:53:36,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:53:36,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:53:36,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:53:36,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:53:36,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:53:36,953 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:53:36,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:53:36,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:53:36,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:53:36,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:53:36,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:53:36,955 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:53:36,955 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_12fdbdde-ede1-455a-a2c2-b6717954f881/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_12fdbdde-ede1-455a-a2c2-b6717954f881/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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2023-11-29 03:53:37,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:53:37,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:53:37,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:53:37,274 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:53:37,274 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:53:37,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-11-29 03:53:40,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:53:40,384 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:53:40,385 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-11-29 03:53:40,399 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data/0e1f63707/2671a80a7eff4e3e8f43943710c8083d/FLAGf471447c4 [2023-11-29 03:53:40,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/data/0e1f63707/2671a80a7eff4e3e8f43943710c8083d [2023-11-29 03:53:40,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:53:40,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:53:40,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:53:40,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:53:40,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:53:40,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41038ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40, skipping insertion in model container [2023-11-29 03:53:40,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,476 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:53:40,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:53:40,770 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:53:40,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:53:40,847 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:53:40,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40 WrapperNode [2023-11-29 03:53:40,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:53:40,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:53:40,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:53:40,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:53:40,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,910 INFO L138 Inliner]: procedures = 122, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2023-11-29 03:53:40,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:53:40,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:53:40,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:53:40,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:53:40,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,951 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2023-11-29 03:53:40,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:53:40,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:53:40,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:53:40,979 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:53:40,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (1/1) ... [2023-11-29 03:53:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:53:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:41,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:53:41,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:53:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 03:53:41,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 03:53:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:53:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:53:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:53:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:53:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:53:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:53:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:53:41,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:53:41,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:53:41,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:53:41,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:53:41,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:53:41,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:53:41,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:53:41,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:53:41,203 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:53:41,205 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:53:41,867 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:53:41,934 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:53:41,934 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-29 03:53:41,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:53:41 BoogieIcfgContainer [2023-11-29 03:53:41,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:53:41,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:53:41,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:53:41,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:53:41,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:53:40" (1/3) ... [2023-11-29 03:53:41,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622523e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:53:41, skipping insertion in model container [2023-11-29 03:53:41,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:40" (2/3) ... [2023-11-29 03:53:41,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622523e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:53:41, skipping insertion in model container [2023-11-29 03:53:41,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:53:41" (3/3) ... [2023-11-29 03:53:41,945 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2023-11-29 03:53:41,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:53:41,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2023-11-29 03:53:42,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:53:42,018 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;@70174a55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:53:42,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2023-11-29 03:53:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 69 states have (on average 2.4057971014492754) internal successors, (166), 137 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 03:53:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:53:42,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:42,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:53:42,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:42,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 10956, now seen corresponding path program 1 times [2023-11-29 03:53:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827736277] [2023-11-29 03:53:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:42,048 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 03:53:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:42,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:42,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:53:42,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:42,210 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 03:53:42,221 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 03:53:42,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:42,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:42,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827736277] [2023-11-29 03:53:42,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827736277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:42,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:53:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348914055] [2023-11-29 03:53:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:42,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:53:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:42,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:53:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:53:42,259 INFO L87 Difference]: Start difference. First operand has 144 states, 69 states have (on average 2.4057971014492754) internal successors, (166), 137 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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 03:53:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:42,633 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2023-11-29 03:53:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:53:42,635 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 03:53:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:42,645 INFO L225 Difference]: With dead ends: 166 [2023-11-29 03:53:42,645 INFO L226 Difference]: Without dead ends: 165 [2023-11-29 03:53:42,647 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 03:53:42,650 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 121 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:42,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 102 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:53:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-29 03:53:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 132. [2023-11-29 03:53:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 63 states have (on average 2.1904761904761907) internal successors, (138), 130 states have internal predecessors, (138), 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 03:53:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2023-11-29 03:53:42,694 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 2 [2023-11-29 03:53:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:42,695 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2023-11-29 03:53:42,695 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 03:53:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2023-11-29 03:53:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:53:42,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:42,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:53:42,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:42,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:42,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:42,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 10957, now seen corresponding path program 1 times [2023-11-29 03:53:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933447921] [2023-11-29 03:53:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:42,900 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 03:53:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:42,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:42,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:53:42,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:42,957 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 03:53:42,970 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 03:53:42,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:42,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933447921] [2023-11-29 03:53:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933447921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:42,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:53:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9195745] [2023-11-29 03:53:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:42,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:53:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:53:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:53:42,975 INFO L87 Difference]: Start difference. First operand 132 states and 143 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 03:53:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:43,403 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2023-11-29 03:53:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:53:43,403 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 03:53:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:43,405 INFO L225 Difference]: With dead ends: 164 [2023-11-29 03:53:43,406 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 03:53:43,406 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 03:53:43,407 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 59 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:43,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 166 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:53:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 03:53:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 128. [2023-11-29 03:53:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 63 states have (on average 2.126984126984127) internal successors, (134), 126 states have internal predecessors, (134), 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 03:53:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2023-11-29 03:53:43,421 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 2 [2023-11-29 03:53:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:43,421 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2023-11-29 03:53:43,421 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 03:53:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2023-11-29 03:53:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:53:43,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:43,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:53:43,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:43,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:43,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:43,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1537122341, now seen corresponding path program 1 times [2023-11-29 03:53:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040490071] [2023-11-29 03:53:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:43,625 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 03:53:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:43,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:43,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:43,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:53:43,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:43,711 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 03:53:43,734 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 03:53:43,755 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 03:53:43,765 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 03:53:43,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:43,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040490071] [2023-11-29 03:53:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040490071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:43,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:43,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:53:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583243415] [2023-11-29 03:53:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:43,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:53:43,768 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:44,302 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2023-11-29 03:53:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:53:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:53:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:44,304 INFO L225 Difference]: With dead ends: 132 [2023-11-29 03:53:44,304 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 03:53:44,304 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 03:53:44,306 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:44,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 199 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:53:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 03:53:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2023-11-29 03:53:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 123 states have internal predecessors, (139), 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 03:53:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2023-11-29 03:53:44,316 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 6 [2023-11-29 03:53:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:44,317 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2023-11-29 03:53:44,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2023-11-29 03:53:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:53:44,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:44,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:53:44,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:44,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:44,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:44,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1537122342, now seen corresponding path program 1 times [2023-11-29 03:53:44,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:44,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138440477] [2023-11-29 03:53:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:44,520 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 03:53:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:44,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:44,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:53:44,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:44,594 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 03:53:44,622 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 03:53:44,626 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 03:53:44,669 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 03:53:44,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 03:53:44,685 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:44,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138440477] [2023-11-29 03:53:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138440477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:44,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:53:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277004095] [2023-11-29 03:53:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:44,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:53:44,688 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:45,229 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2023-11-29 03:53:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:53:45,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:53:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:45,231 INFO L225 Difference]: With dead ends: 121 [2023-11-29 03:53:45,231 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 03:53:45,231 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 03:53:45,232 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:45,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 295 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:53:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 03:53:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-29 03:53:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 119 states have internal predecessors, (135), 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 03:53:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2023-11-29 03:53:45,242 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 6 [2023-11-29 03:53:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:45,242 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2023-11-29 03:53:45,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2023-11-29 03:53:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:53:45,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:45,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:45,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:45,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:45,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:45,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash 769396375, now seen corresponding path program 1 times [2023-11-29 03:53:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359835898] [2023-11-29 03:53:45,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:45,444 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 03:53:45,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:45,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:45,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:53:45,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:45,537 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 03:53:45,554 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 03:53:45,569 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 03:53:45,578 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 03:53:45,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:45,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359835898] [2023-11-29 03:53:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359835898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:53:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656346997] [2023-11-29 03:53:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:53:45,581 INFO L87 Difference]: Start difference. First operand 121 states and 140 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 03:53:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:46,125 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2023-11-29 03:53:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:53:46,126 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 03:53:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:46,127 INFO L225 Difference]: With dead ends: 127 [2023-11-29 03:53:46,127 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 03:53:46,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:53:46,128 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:46,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 193 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:53:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 03:53:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2023-11-29 03:53:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 118 states have internal predecessors, (134), 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 03:53:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2023-11-29 03:53:46,137 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 10 [2023-11-29 03:53:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:46,137 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2023-11-29 03:53:46,138 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 03:53:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2023-11-29 03:53:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:53:46,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:46,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:46,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:46,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:46,342 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:46,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:46,343 INFO L85 PathProgramCache]: Analyzing trace with hash 769396376, now seen corresponding path program 1 times [2023-11-29 03:53:46,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:46,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485003238] [2023-11-29 03:53:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:46,343 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 03:53:46,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:46,344 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:46,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:46,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:53:46,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:46,467 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 03:53:46,489 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 03:53:46,496 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 03:53:46,525 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 03:53:46,540 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 03:53:46,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:46,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:46,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485003238] [2023-11-29 03:53:46,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485003238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:46,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:46,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:53:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126377296] [2023-11-29 03:53:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:46,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:46,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:46,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:46,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:53:46,543 INFO L87 Difference]: Start difference. First operand 120 states and 139 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 03:53:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:47,061 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2023-11-29 03:53:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:53:47,062 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 03:53:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:47,063 INFO L225 Difference]: With dead ends: 120 [2023-11-29 03:53:47,063 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 03:53:47,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:53:47,064 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:47,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 283 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:53:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 03:53:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2023-11-29 03:53:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 115 states have internal predecessors, (131), 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 03:53:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2023-11-29 03:53:47,069 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 10 [2023-11-29 03:53:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:47,069 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2023-11-29 03:53:47,069 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 03:53:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2023-11-29 03:53:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:53:47,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:47,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:47,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:47,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:47,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:47,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 41858133, now seen corresponding path program 1 times [2023-11-29 03:53:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224853136] [2023-11-29 03:53:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:47,272 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 03:53:47,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:47,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:47,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:47,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:53:47,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:47,398 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 03:53:47,405 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 03:53:47,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:47,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:47,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224853136] [2023-11-29 03:53:47,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224853136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:47,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:47,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:53:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141930861] [2023-11-29 03:53:47,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:47,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:53:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:53:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:53:47,407 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:47,659 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2023-11-29 03:53:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:53:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 03:53:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:47,660 INFO L225 Difference]: With dead ends: 122 [2023-11-29 03:53:47,660 INFO L226 Difference]: Without dead ends: 122 [2023-11-29 03:53:47,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 03:53:47,661 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:47,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:53:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-29 03:53:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2023-11-29 03:53:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 110 states have internal predecessors, (126), 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 03:53:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2023-11-29 03:53:47,667 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 15 [2023-11-29 03:53:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:47,668 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2023-11-29 03:53:47,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2023-11-29 03:53:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:53:47,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:47,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:47,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:47,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:47,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:47,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash 41858132, now seen corresponding path program 1 times [2023-11-29 03:53:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914974616] [2023-11-29 03:53:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:47,870 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 03:53:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:47,871 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:47,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:47,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:53:47,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:48,004 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 03:53:48,010 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 03:53:48,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:48,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:48,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914974616] [2023-11-29 03:53:48,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914974616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:48,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:48,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:53:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902186335] [2023-11-29 03:53:48,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:48,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:53:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:48,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:53:48,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:53:48,012 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:48,258 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2023-11-29 03:53:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:53:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 03:53:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:48,260 INFO L225 Difference]: With dead ends: 117 [2023-11-29 03:53:48,260 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:53:48,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 03:53:48,261 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 54 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:48,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 115 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:53:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:53:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2023-11-29 03:53:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.704225352112676) internal successors, (121), 105 states have internal predecessors, (121), 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 03:53:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2023-11-29 03:53:48,266 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 15 [2023-11-29 03:53:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:48,267 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2023-11-29 03:53:48,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2023-11-29 03:53:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:53:48,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:48,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:48,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:48,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:48,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:48,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1571038946, now seen corresponding path program 1 times [2023-11-29 03:53:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:48,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358445253] [2023-11-29 03:53:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:48,470 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 03:53:48,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:48,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:48,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:48,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:53:48,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:48,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:53:48,698 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 03:53:48,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:53:48,734 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 03:53:48,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:48,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358445253] [2023-11-29 03:53:48,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358445253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:48,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:48,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:53:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121433231] [2023-11-29 03:53:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:48,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:53:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:48,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:53:48,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:53:48,737 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:49,092 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2023-11-29 03:53:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:53:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:53:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:49,094 INFO L225 Difference]: With dead ends: 151 [2023-11-29 03:53:49,094 INFO L226 Difference]: Without dead ends: 151 [2023-11-29 03:53:49,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 03:53:49,095 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 184 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:49,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:53:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-29 03:53:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 113. [2023-11-29 03:53:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 111 states have internal predecessors, (132), 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 03:53:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2023-11-29 03:53:49,100 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 17 [2023-11-29 03:53:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:49,100 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2023-11-29 03:53:49,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2023-11-29 03:53:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:53:49,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:49,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:49,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:49,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:49,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:49,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:49,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1571038947, now seen corresponding path program 1 times [2023-11-29 03:53:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:49,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487808190] [2023-11-29 03:53:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:49,303 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 03:53:49,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:49,304 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:49,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:49,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:53:49,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:49,452 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 03:53:49,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:53:49,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:49,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:53:49,503 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:53:49,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:53:49,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:49,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:53:49,571 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:53:49,572 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 03:53:49,632 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 03:53:49,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:49,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:49,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487808190] [2023-11-29 03:53:49,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487808190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:49,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:49,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:53:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060801674] [2023-11-29 03:53:49,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:49,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:49,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:49,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:49,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:53:49,635 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:50,180 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2023-11-29 03:53:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:53:50,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:53:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:50,182 INFO L225 Difference]: With dead ends: 194 [2023-11-29 03:53:50,182 INFO L226 Difference]: Without dead ends: 194 [2023-11-29 03:53:50,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:53:50,183 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 310 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:50,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 116 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:53:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-29 03:53:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2023-11-29 03:53:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 110 states have (on average 1.6727272727272726) internal successors, (184), 144 states have internal predecessors, (184), 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 03:53:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2023-11-29 03:53:50,189 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 17 [2023-11-29 03:53:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:50,189 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2023-11-29 03:53:50,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2023-11-29 03:53:50,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:53:50,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:50,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:50,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:50,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:50,390 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:50,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:50,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1457568018, now seen corresponding path program 1 times [2023-11-29 03:53:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:50,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412576798] [2023-11-29 03:53:50,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:50,391 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 03:53:50,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:50,392 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:50,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:50,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:53:50,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:50,525 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 03:53:50,525 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:50,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412576798] [2023-11-29 03:53:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412576798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:50,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:53:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143041377] [2023-11-29 03:53:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:50,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:53:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:50,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:53:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:53:50,527 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 03:53:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:50,802 INFO L93 Difference]: Finished difference Result 181 states and 218 transitions. [2023-11-29 03:53:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:50,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-29 03:53:50,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:50,804 INFO L225 Difference]: With dead ends: 181 [2023-11-29 03:53:50,804 INFO L226 Difference]: Without dead ends: 181 [2023-11-29 03:53:50,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 03:53:50,805 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 165 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:50,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 180 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:53:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-29 03:53:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 145. [2023-11-29 03:53:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 143 states have internal predecessors, (181), 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 03:53:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2023-11-29 03:53:50,810 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 18 [2023-11-29 03:53:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:50,810 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2023-11-29 03:53:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 03:53:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2023-11-29 03:53:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:53:50,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:50,811 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] [2023-11-29 03:53:50,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:51,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:51,012 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:51,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash 566047051, now seen corresponding path program 1 times [2023-11-29 03:53:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836994668] [2023-11-29 03:53:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:51,013 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 03:53:51,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:51,014 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:51,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:51,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 03:53:51,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:51,248 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 03:53:51,272 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 03:53:51,284 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:53:51,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:53:51,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:53:51,331 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 03:53:51,342 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 03:53:51,463 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:53:51,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:53:51,499 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:53:51,500 INFO L378 Elim1Store]: Elim1 eliminated variable 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 31 treesize of output 22 [2023-11-29 03:53:51,555 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:53:51,555 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:53:51,575 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:53:51,575 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 03:53:51,595 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:53:51,595 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 31 treesize of output 22 [2023-11-29 03:53:51,692 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-11-29 03:53:51,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 25 [2023-11-29 03:53:51,710 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 03:53:51,902 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:53:51,902 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 47 treesize of output 42 [2023-11-29 03:53:51,927 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 03:53:51,962 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:53:51,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:53:52,074 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:53:52,074 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:53:52,133 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:53:52,134 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 56 treesize of output 49 [2023-11-29 03:53:52,245 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:53:52,245 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 56 treesize of output 49 [2023-11-29 03:53:52,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:52,255 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 03:53:52,441 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 03:53:52,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:52,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:52,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836994668] [2023-11-29 03:53:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836994668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:52,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 03:53:52,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587400625] [2023-11-29 03:53:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:52,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:53:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:53:52,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:53:52,443 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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 03:53:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:54,461 INFO L93 Difference]: Finished difference Result 173 states and 207 transitions. [2023-11-29 03:53:54,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:53:54,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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 03:53:54,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:54,463 INFO L225 Difference]: With dead ends: 173 [2023-11-29 03:53:54,463 INFO L226 Difference]: Without dead ends: 173 [2023-11-29 03:53:54,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:53:54,464 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 135 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:54,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 608 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 03:53:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-29 03:53:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 151. [2023-11-29 03:53:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 149 states have internal predecessors, (185), 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 03:53:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 188 transitions. [2023-11-29 03:53:54,467 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 188 transitions. Word has length 20 [2023-11-29 03:53:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:54,468 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 188 transitions. [2023-11-29 03:53:54,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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 03:53:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 188 transitions. [2023-11-29 03:53:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:53:54,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:54,469 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] [2023-11-29 03:53:54,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:54,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:54,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1573212541, now seen corresponding path program 1 times [2023-11-29 03:53:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485486534] [2023-11-29 03:53:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:54,670 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 03:53:54,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:54,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:54,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:53:54,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:54,802 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 03:53:54,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:54,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:54,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485486534] [2023-11-29 03:53:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485486534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:53:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683560075] [2023-11-29 03:53:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:54,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:53:54,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:54,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:53:54,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:53:54,805 INFO L87 Difference]: Start difference. First operand 151 states and 188 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 03:53:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:54,924 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2023-11-29 03:53:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:53:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2023-11-29 03:53:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:54,926 INFO L225 Difference]: With dead ends: 150 [2023-11-29 03:53:54,926 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 03:53:54,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 03:53:54,927 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:54,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:53:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 03:53:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-29 03:53:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 148 states have internal predecessors, (184), 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 03:53:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2023-11-29 03:53:54,932 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 24 [2023-11-29 03:53:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:54,932 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2023-11-29 03:53:54,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 03:53:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2023-11-29 03:53:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:53:54,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:54,933 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 03:53:54,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:55,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:55,134 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:55,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:55,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2060682207, now seen corresponding path program 1 times [2023-11-29 03:53:55,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569898604] [2023-11-29 03:53:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:55,135 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 03:53:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:55,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:55,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:53:55,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:55,324 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 03:53:55,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:55,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569898604] [2023-11-29 03:53:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569898604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:55,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:53:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997827665] [2023-11-29 03:53:55,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:55,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:53:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:53:55,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:53:55,326 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 03:53:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:55,650 INFO L93 Difference]: Finished difference Result 182 states and 213 transitions. [2023-11-29 03:53:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:55,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-29 03:53:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:55,652 INFO L225 Difference]: With dead ends: 182 [2023-11-29 03:53:55,652 INFO L226 Difference]: Without dead ends: 182 [2023-11-29 03:53:55,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 03:53:55,653 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 167 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:55,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 146 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:53:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-29 03:53:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2023-11-29 03:53:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.5630252100840336) internal successors, (186), 150 states have internal predecessors, (186), 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 03:53:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2023-11-29 03:53:55,657 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 25 [2023-11-29 03:53:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:55,657 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2023-11-29 03:53:55,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 03:53:55,658 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2023-11-29 03:53:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:53:55,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:55,659 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] [2023-11-29 03:53:55,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:55,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:55,863 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:55,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1772464190, now seen corresponding path program 1 times [2023-11-29 03:53:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:55,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013695949] [2023-11-29 03:53:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:55,864 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 03:53:55,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:55,865 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:55,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:56,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 03:53:56,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:56,102 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 03:53:56,118 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 03:53:56,140 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:53:56,140 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 03:53:56,146 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 03:53:56,172 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 03:53:56,183 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 03:53:56,215 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 03:53:56,253 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 03:53:56,275 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:53:56,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:53:56,289 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 03:53:56,336 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 03:53:56,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:53:56,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 03:53:56,432 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 03:53:56,461 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 03:53:56,478 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 03:53:56,512 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 03:53:56,568 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:53:56,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:53:56,653 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-29 03:53:56,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2023-11-29 03:53:56,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:53:56,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:53:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:53:56,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:56,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:53:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013695949] [2023-11-29 03:53:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013695949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:56,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 03:53:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567531226] [2023-11-29 03:53:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:56,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:53:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:53:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:53:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:53:56,981 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:59,300 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2023-11-29 03:53:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:53:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 03:53:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:59,302 INFO L225 Difference]: With dead ends: 251 [2023-11-29 03:53:59,303 INFO L226 Difference]: Without dead ends: 251 [2023-11-29 03:53:59,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2023-11-29 03:53:59,304 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 417 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:59,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 687 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 03:53:59,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-29 03:53:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 170. [2023-11-29 03:53:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.510948905109489) internal successors, (207), 168 states have internal predecessors, (207), 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 03:53:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2023-11-29 03:53:59,310 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 27 [2023-11-29 03:53:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:59,310 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2023-11-29 03:53:59,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2023-11-29 03:53:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:53:59,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:59,311 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] [2023-11-29 03:53:59,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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)] Ended with exit code 0 [2023-11-29 03:53:59,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:59,512 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:53:59,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1816383173, now seen corresponding path program 1 times [2023-11-29 03:53:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:53:59,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137917279] [2023-11-29 03:53:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:59,513 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 03:53:59,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:53:59,514 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:59,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:53:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:59,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 03:53:59,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:59,711 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 03:53:59,723 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:53:59,723 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 03:53:59,735 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 03:53:59,783 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:53:59,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-29 03:53:59,806 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:53:59,806 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:53:59,833 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 03:53:59,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:53:59,880 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:53:59,881 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 31 treesize of output 15 [2023-11-29 03:53:59,999 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:54:00,000 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 51 treesize of output 46 [2023-11-29 03:54:00,010 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 03:54:00,115 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:54:00,115 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 60 treesize of output 53 [2023-11-29 03:54:00,203 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:54:00,203 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 60 treesize of output 53 [2023-11-29 03:54:00,227 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 16 treesize of output 12 [2023-11-29 03:54:00,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-29 03:54:00,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:00,496 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 36 treesize of output 18 [2023-11-29 03:54:00,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-11-29 03:54:00,566 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 03:54:00,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:00,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_855 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_855) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_853) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 03:54:00,764 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_855 (_ BitVec 1))) (= (bvadd (select (store |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_855) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_853) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:54:00,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:00,836 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 26 treesize of output 30 [2023-11-29 03:54:01,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:01,128 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 35 treesize of output 36 [2023-11-29 03:54:01,134 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:01,137 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 54 treesize of output 46 [2023-11-29 03:54:01,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:01,159 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 63 treesize of output 61 [2023-11-29 03:54:01,220 INFO L349 Elim1Store]: treesize reduction 37, result has 39.3 percent of original size [2023-11-29 03:54:01,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 165 [2023-11-29 03:54:01,282 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 03:54:01,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:54:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137917279] [2023-11-29 03:54:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137917279] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:01,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:54:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-11-29 03:54:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756712952] [2023-11-29 03:54:01,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:01,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 03:54:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:54:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 03:54:01,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=403, Unknown=9, NotChecked=86, Total=600 [2023-11-29 03:54:01,285 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:54:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:03,909 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2023-11-29 03:54:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:54:03,911 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:54:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:54:03,912 INFO L225 Difference]: With dead ends: 212 [2023-11-29 03:54:03,912 INFO L226 Difference]: Without dead ends: 212 [2023-11-29 03:54:03,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=833, Unknown=10, NotChecked=126, Total=1190 [2023-11-29 03:54:03,914 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 197 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:54:03,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 626 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 943 Invalid, 0 Unknown, 338 Unchecked, 2.1s Time] [2023-11-29 03:54:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-29 03:54:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 179. [2023-11-29 03:54:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4931506849315068) internal successors, (218), 177 states have internal predecessors, (218), 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 03:54:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 220 transitions. [2023-11-29 03:54:03,920 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 220 transitions. Word has length 28 [2023-11-29 03:54:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:54:03,920 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 220 transitions. [2023-11-29 03:54:03,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:54:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 220 transitions. [2023-11-29 03:54:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:54:03,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:54:03,922 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] [2023-11-29 03:54:03,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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)] Ended with exit code 0 [2023-11-29 03:54:04,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:54:04,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:54:04,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1816383174, now seen corresponding path program 1 times [2023-11-29 03:54:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:54:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53808382] [2023-11-29 03:54:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:04,129 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 03:54:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:54:04,130 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:54:04,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:54:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:04,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 03:54:04,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:04,399 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 03:54:04,418 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:54:04,418 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 03:54:04,424 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 03:54:04,452 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 03:54:04,465 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 03:54:04,550 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:54:04,551 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:54:04,557 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 5 treesize of output 3 [2023-11-29 03:54:04,575 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:54:04,576 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:54:04,610 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:54:04,610 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 03:54:04,630 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:54:04,630 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 03:54:04,638 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 5 treesize of output 3 [2023-11-29 03:54:04,667 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:54:04,667 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 33 treesize of output 24 [2023-11-29 03:54:04,690 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 03:54:04,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 03:54:04,772 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:54:04,772 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 40 treesize of output 20 [2023-11-29 03:54:04,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:04,789 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 03:54:04,943 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:54:04,944 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 62 treesize of output 51 [2023-11-29 03:54:04,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-29 03:54:05,000 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:54:05,001 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:54:05,009 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 5 treesize of output 3 [2023-11-29 03:54:05,100 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:54:05,101 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:54:05,106 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 5 treesize of output 3 [2023-11-29 03:54:05,152 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:54:05,152 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 71 treesize of output 58 [2023-11-29 03:54:05,240 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:54:05,240 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 71 treesize of output 58 [2023-11-29 03:54:05,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:05,251 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 03:54:05,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 03:54:05,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-11-29 03:54:05,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2023-11-29 03:54:05,510 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 03:54:05,553 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 03:54:05,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:05,913 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_940) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (forall ((v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2023-11-29 03:54:05,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_941) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_941) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_940) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) is different from false [2023-11-29 03:54:06,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:06,741 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 61 treesize of output 65 [2023-11-29 03:54:06,773 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 40 treesize of output 34 [2023-11-29 03:54:28,520 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_111 (_ BitVec 32))) (or (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_prenex_1) v_arrayElimCell_111 v_prenex_2) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))) (not (= (select |c_#valid| v_arrayElimCell_111) (_ bv0 1))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_935) .cse2 v_ArrVal_941) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) (_ bv8 32)) (select (store |c_#length| .cse2 (_ bv12 32)) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_arrayElimArr_3) .cse2 v_ArrVal_940) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (not (= (select |c_#valid| .cse2) (_ bv0 1)))))))) is different from false [2023-11-29 03:54:28,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:28,576 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 97 [2023-11-29 03:54:28,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 548 treesize of output 520 [2023-11-29 03:54:28,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:28,655 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 253 treesize of output 230 [2023-11-29 03:54:28,671 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 968 treesize of output 932 [2023-11-29 03:54:28,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:28,754 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 179 treesize of output 172 [2023-11-29 03:54:28,768 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 163 treesize of output 161 [2023-11-29 03:54:28,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:28,914 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 170 treesize of output 194 [2023-11-29 03:54:28,933 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 157 treesize of output 153 [2023-11-29 03:54:28,948 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 153 treesize of output 149 [2023-11-29 03:54:28,962 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 149 treesize of output 145 [2023-11-29 03:54:28,976 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 145 treesize of output 137 [2023-11-29 03:54:29,880 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 03:54:29,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:54:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53808382] [2023-11-29 03:54:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53808382] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:29,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:54:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2023-11-29 03:54:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316196805] [2023-11-29 03:54:29,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:29,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:54:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:54:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:54:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=304, Unknown=17, NotChecked=114, Total=506 [2023-11-29 03:54:29,883 INFO L87 Difference]: Start difference. First operand 179 states and 220 transitions. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:55:58,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:56:03,552 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 03:56:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:56:24,819 INFO L93 Difference]: Finished difference Result 225 states and 268 transitions. [2023-11-29 03:56:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:56:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:56:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:56:24,822 INFO L225 Difference]: With dead ends: 225 [2023-11-29 03:56:24,822 INFO L226 Difference]: Without dead ends: 225 [2023-11-29 03:56:24,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 119.0s TimeCoverageRelationStatistics Valid=213, Invalid=876, Unknown=45, NotChecked=198, Total=1332 [2023-11-29 03:56:24,823 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 227 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:56:24,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 613 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 897 Invalid, 2 Unknown, 499 Unchecked, 19.4s Time] [2023-11-29 03:56:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-29 03:56:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 195. [2023-11-29 03:56:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 165 states have (on average 1.503030303030303) internal successors, (248), 193 states have internal predecessors, (248), 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 03:56:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 250 transitions. [2023-11-29 03:56:24,828 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 250 transitions. Word has length 28 [2023-11-29 03:56:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:56:24,829 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 250 transitions. [2023-11-29 03:56:24,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:56:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 250 transitions. [2023-11-29 03:56:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:56:24,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:56:24,830 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] [2023-11-29 03:56:24,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:56:25,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:56:25,031 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2023-11-29 03:56:25,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:56:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2022720759, now seen corresponding path program 1 times [2023-11-29 03:56:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:56:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934497212] [2023-11-29 03:56:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:56:25,032 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 03:56:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:56:25,032 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:56:25,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12fdbdde-ede1-455a-a2c2-b6717954f881/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 03:56:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:25,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 03:56:25,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:56:25,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:56:25,496 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:56:25,496 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 03:56:25,664 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 03:56:26,167 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:56:26,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-29 03:56:26,353 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:56:26,353 INFO L378 Elim1Store]: Elim1 eliminated variable 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 03:56:26,482 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:56:26,482 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 03:56:26,896 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:56:26,896 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 31 treesize of output 15 [2023-11-29 03:56:27,826 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:56:27,827 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 51 treesize of output 46 [2023-11-29 03:56:27,915 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 03:56:28,533 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:56:28,533 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 60 treesize of output 53 [2023-11-29 03:56:29,048 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:56:29,049 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 60 treesize of output 53 [2023-11-29 03:56:29,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 5 [2023-11-29 03:56:29,723 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2023-11-29 03:56:29,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2023-11-29 03:56:30,253 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:56:30,253 INFO L378 Elim1Store]: Elim1 eliminated variable 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 36 treesize of output 31 [2023-11-29 03:56:30,366 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 22 treesize of output 16 [2023-11-29 03:56:31,295 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:56:31,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2023-11-29 03:56:31,468 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 22 treesize of output 16 [2023-11-29 03:56:34,491 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:56:34,491 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 88 treesize of output 84 [2023-11-29 03:56:35,050 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 03:56:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:56:35,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:56:41,026 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 03:56:47,905 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_ArrVal_1029 (_ BitVec 1))) (or (= |v_ULTIMATE.start_main_~item~0#1.base_51| |c_ULTIMATE.start_main_~bucket~0#1.base|) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1029) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) (_ bv0 1))))) (or (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (_ BitVec 1))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1029) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) (_ bv0 1))))) (not (bvule (bvadd |c_ULTIMATE.start_main_~bucket~0#1.offset| (_ bv12 32)) (_ bv8 32)))))) is different from false [2023-11-29 03:56:49,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:56:49,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 183 treesize of output 381 [2023-11-29 03:57:00,930 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (not (bvule (bvadd |c_ULTIMATE.start_main_~bucket~0#1.offset| (_ bv12 32)) (_ bv8 32)))) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (and (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~item~0#1.base_51| .cse0) (= .cse0 v_prenex_6) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|))))) .cse4) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32)) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (or (= v_prenex_6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_6)))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse6 (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~item~0#1.base_51| .cse6) (= v_prenex_6 .cse7) (= .cse6 .cse7) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse7) (= |v_ULTIMATE.start_main_~item~0#1.base_51| v_prenex_6) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|))))) .cse4) (or .cse4 (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32)) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse9 (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse10) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse9) (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_6) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|)))))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (or (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|)))) .cse4) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse13 (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse13) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32))) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= v_prenex_6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= .cse14 .cse13) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse14) (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_6)))))))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32)) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse17 (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse16 (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= v_prenex_6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= .cse16 .cse17) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse17) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse16) (= |v_ULTIMATE.start_main_~item~0#1.base_51| v_prenex_6) (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_6))))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse20 (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse19 (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~item~0#1.base_51| .cse19) (= .cse19 v_prenex_6) (= .cse19 .cse20) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse20) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse19) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|))))) .cse4) (or .cse4 (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse22 (select (select (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse23 (select (select (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~item~0#1.base_51| .cse22) (= .cse22 v_prenex_6) (= .cse22 .cse23) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse23) (= |v_ULTIMATE.start_main_~item~0#1.base_51| v_prenex_6) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse25 (select (select (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse26 (select (select (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= v_prenex_6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= v_prenex_6 .cse25) (= .cse26 .cse25) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse26) (= |v_ULTIMATE.start_main_~item~0#1.base_51| v_prenex_6) (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_6))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32)) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse28 (select (select (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse29 (select (select (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= v_prenex_6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= v_prenex_6 .cse28) (= .cse29 .cse28) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse29) (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_6))))) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| (_ BitVec 32))) (or (forall ((v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~bcki~0#1.offset| (_ BitVec 32))) (let ((.cse33 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (let ((.cse31 (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1027) |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1031) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32))) (let ((.cse32 (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_6 v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= v_prenex_6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= v_prenex_6 .cse31) (= .cse32 .cse31) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse32) (= |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_6)))) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse31))))) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|))))) is different from true [2023-11-29 03:57:26,930 WARN L293 SmtUtils]: Spent 25.82s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:57:26,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:57:26,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 12 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 12 new quantified variables, introduced 12 case distinctions, treesize of input 1047 treesize of output 1894 [2023-11-29 03:58:10,779 INFO L224 Elim1Store]: Index analysis took 9031 ms